12222986

Systems and Methods for In-Situ Graph-Based Data Processing

PublishedFebruary 11, 2025
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
27 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A system for dynamic generation of executable graph-based models, the system comprising processing circuitry and a memory unit operatively coupled to the processing circuitry and having instructions stored thereon that, based on execution by the processing circuitry, cause the processing circuitry to: obtain a graph-based model comprising a plurality of nodes including a set of edge nodes and a set of role nodes, wherein: each edge node connects two or more nodes, of the plurality of nodes, via a corresponding plurality of roles, and each role corresponds to a role node of the set of role nodes, and is indicative of a relationship between a corresponding edge node and a node, of the plurality of nodes, connected to the corresponding edge node; obtain a first overlay node comprising processing logic operable to interact with at least one node of an associated graph-based model; determine an association between a first node of the graph-based model and the first overlay node; and generate an executable graph-based model, wherein the executable graph-based model includes a first executable node comprising a composition of the first node of the graph-based model and the first overlay node based on the association between the first node of the graph-based model and the first overlay node.

2

2. The system of claim 1, wherein the instructions based on the execution by the processing circuitry, further cause the processing circuitry to: receive a first stimulus associated with the first overlay node; and in response to the first stimulus being received, cause execution of said processing logic of the first executable node.

3

3. The system of claim 2, wherein the first stimulus comprises a first context such that execution of said processing logic of the first executable node is based on the first context.

4

4. The system of claim 2, wherein the first node comprises a state, and wherein the state is shared by the first node and a second node of the graph-based model.

5

5. The system of claim 2, wherein the first node comprises a state, and wherein execution of said processing logic of the first executable node causes a change in the state of the first node.

6

6. The system of claim 5, wherein the state of the first node comprises a first attribute, and wherein execution of said processing logic of the first executable node causes a value of the first attribute to be set.

7

7. The system of claim 5, wherein the state of the first node comprises a first attribute, and wherein execution of said processing logic of the first executable node causes a value of the first attribute to be output.

8

8. The system of claim 5, wherein the state of the first node comprises a first attribute, and wherein execution of said processing logic of the first executable node causes a second attribute to be generated for the state of the first node.

9

9. The system of claim 8, wherein execution of said processing logic of the first executable node causes a value for the second attribute to be set.

10

10. The system of claim 2, wherein execution of said processing logic of the first executable node causes a second stimulus associated with a second overlay node to be fired.

11

11. The system of claim 10, wherein the instructions based on the execution by the processing circuitry, further cause the processing circuitry to: receive the second stimulus associated with the second overlay node; and in response to the second stimulus being received, cause execution of processing logic associated with the second overlay node.

12

12. The system of claim 2, wherein the instructions based on the execution by the processing circuitry, further cause the processing circuitry to: in response to the first stimulus being received, cause execution of processing logic of a second executable node in the executable graph-based model, wherein the second executable node comprises a composition of a second node of the graph-based model and the first overlay node.

13

13. The system of claim 1, wherein the first node is derived from a second node and a third node.

14

14. The system of claim 1, wherein the first node comprises a unique identifier, one or more attributes each having corresponding attribute values, a version, a name, a namespace, and associated metadata.

15

15. The system of claim 1, wherein the association between the first node of the graph-based model and the first overlay node is determined based on a predetermined configuration.

16

16. The system of claim 1, wherein each node is associated with a node type, wherein the plurality of nodes further include a set of data nodes, and wherein the node type of the first node is a data node type.

17

17. The system of claim 1, wherein each node is associated with a node type, wherein the plurality of nodes further include a set of value nodes, and wherein the node type of the first node is a value node type.

18

18. The system of claim 1, wherein each node is associated with a node type, and wherein the first overlay node is a node associated with an overlay node type.

19

19. The system of claim 1, wherein each node is associated with a node type, the first overlay node defines the node type of the first node.

20

20. The system of claim 1, wherein the first node comprises a composition of a second node of the graph-based model and a second overlay node.

21

21. The system of claim 20, wherein each node is associated with a node type, and wherein execution of the first executable node causes execution of said processing logic of the first overlay node and said processing logic of the second overlay node.

22

22. The system of claim 21, wherein execution of said processing logic of the second overlay node is dependent upon execution of said processing logic of the first overlay node.

23

23. The system of claim 21, wherein execution of said processing logic of the first overlay node is dependent upon execution of said processing logic of the second overlay node.

24

24. The system of claim 1, wherein each node is associated with a node type, and wherein the node type of the first node is an edge node type such that the first node is a first edge node of the set of edge nodes.

25

25. The system of claim 24, wherein each role in the corresponding plurality of roles defines a relationship between the first edge node and a respective node of the plurality of nodes connected by the first edge node.

26

26. A method for dynamic generation of executable graph-based models, the method comprising: obtaining, by processing circuitry, a graph-based model comprising a plurality of nodes including a set of edge nodes and a set of role nodes, wherein: each edge node connects two or more nodes, of the plurality of nodes, via a corresponding plurality of roles, and each role corresponds to a role node of the set of role nodes, and is indicative of a relationship between a corresponding edge node and a node, of the plurality of nodes, connected to the corresponding edge node; obtaining, by the processing circuitry, a first overlay node comprising processing logic operable to interact with at least one node of an associated graph-based model; determining, by the processing circuitry, an association between a first node of the graph-based model and the first overlay node; and generating, by the processing circuitry, an executable graph-based model, wherein the executable graph-based model includes a first executable node comprising a composition of the first node of the graph-based model and the first overlay node based on the association between the first node of the graph-based model and the first overlay node.

27

27. A non-transitory computer-readable medium storing instructions which, based on execution by processing circuitry, cause the processing circuitry to: obtain a graph-based model comprising-one or more a plurality of nodes including a set of edge nodes and a set of role nodes, wherein: each edge node connects two or more nodes, of the plurality of nodes, via a corresponding plurality of roles, and each role corresponds to a role node of the set of role nodes, and is indicative of a relationship between a corresponding edge node and a node, of the plurality of nodes, connected to the corresponding edge node; obtain a first overlay node comprising processing logic operable to interact with at least one node of an associated graph-based model; determine an association between a first node of the graph-based model and the first overlay node; and generate an executable graph-based model, wherein the executable graph-based model includes a first executable node comprising a composition of the first node of the graph-based model and the first overlay node based on the association between the first node of the graph-based model and the first overlay node.

Patent Metadata

Filing Date

Unknown

Publication Date

February 11, 2025

Inventors

Steven SCHILDERS

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “SYSTEMS AND METHODS FOR IN-SITU GRAPH-BASED DATA PROCESSING” (12222986). https://patentable.app/patents/12222986

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.