US5392220A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for organizing data
Assignee: US Philips Corp
•
Filing: 1994-04-25
•
Granted: 1995-02-21
•
Expires: 2014-04-25
Abstract
Abstract The invention describes the organizing and accessing of data pertaining to an engineering process. The process is partitioned into subprocess which are linked in a directed-acyclic-graph. Each link has a source node and a destination node, indicating which source node(s) must have been executed to provide the data necessary for executing the destination nodes. Executing any subprocess provides an instance of data associated to that node. The latter instances are linked in a second directed-acyclic-graph wherein each link indicates that part or all of the data at the source node has effectively been used for generating the data at its destination node. The two graphs are interlinked and provide for easy browsing of the data as well as for easy selection of input data for engineering subprocesses.
Inventors
- 👤 Peter van den Hamer
- 👤 Menno A. Treffers
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 06:18
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/901; G06F16/9024; G06F30/00; G06F40/00; G06F40/10; G06F40/12; G06F40/14; G06F40/151; G06F40/197; Y; Y10; Y10S; Y10S707/00; Y10S707/99931
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
346 words
A method for organizing and accessing data stored in a data management system, the data being one of generated by or utilized in a plurality of sub-processes of a single process, comprising the steps of: generating a first set of flow nodes, each flow node representing a corresponding subprocess; performing a flow node execution corresponding to the sub-process, wherein a portion of the data is one of utilized by the sub-process or generated by the sub-process; linking the flow nodes to form a data flow model of the process by connecting a source flow node to a destination flow node to form a first directed-acyclic graph, wherein each flow link represents data generated by execution by the source flow node and required by the destination flow node; generating a set of data nodes, each data node corresponding to one of the flow nodes for representing one execution of the corresponding flow node and the data generated by the corresponding flow node; linking said data nodes to form a second directed-acyclic graph by connecting a source data node to a destination data node which represents a portion of the data represented by the source data node for generating data represented by the destination data node; selecting a first subset of data nodes from the set of data nodes by selecting the data nodes which reference a selected flow node; selecting a predetermined number of auxiliary subsets of data nodes, each auxiliary subset referencing one further flow node that is one of directly and indirectly linked as a source flow node to the further flow node by a flow link in the first directed-acyclic graph; generating a final subset of data nodes from the first subset of data nodes by selecting data nodes in the first subset of data nodes for which the corresponding sub-process had utilized data corresponding to one of the data nodes in each of the auxiliary subsets of data nodes; and accessing the data represented by the final subset of data nodes by mapping the data nodes to the data stored in the system.
Claim 2
Independent Claim
346 words
A method for organizing and accessing data stored in a data management system, the data being one of generated by or utilized in a plurality of sub-processes of a single process, comprising the steps of: generating a first set of flow nodes, each flow node representing a corresponding subprocess; performing a flow node execution corresponding to the sub-process, wherein a portion of the data is one of utilized by the sub-process or generated by the sub-process; linking the flow nodes to form a data flow model of the process by connecting a source flow node to a destination flow node to form a first directed-acyclic graph, wherein each flow link represents data generated by execution by the source flow node and required by the destination flow node; generating a set of data nodes, each data node corresponding to one of the flow nodes for representing one execution of the corresponding flow node and the data generated by the corresponding flow node; linking said data nodes to form a second directed-acyclic graph by connecting a source data node to a destination data node which represents a portion of the data represented by the source data node for generating data represented by the destination data node; selecting a first subset of data nodes from the set of data nodes by selecting the data nodes which reference a selected flow node; selecting a predetermined number of auxiliary subsets of data nodes, each auxiliary subset referencing one further flow node that is one of directly and indirectly linked as a source flow node to the further flow node by a flow link in the first directed-acyclic graph; generating a final subset of data nodes from the first subset of data nodes by selecting data nodes in the first subset of data nodes for which the corresponding sub-process had utilized data corresponding to one of the data nodes in each of the auxiliary subsets of data nodes; and accessing the data represented by the final subset of data nodes by mapping the data nodes to the data stored in the system.
Claim 3
Dependent Claim
101 words
The method of claim 1, further including generating a second predetermined number of auxiliary subsets of data nodes, each second auxiliary subset referencing a second flow node that is linked as a destination flow node to the first flow node by a further flow link in the first directed-acyclic graph; and generating a final subset of data nodes from the first subset of data nodes by selecting data nodes in the first subset of data nodes for which the corresponding sub-process had utilized data corresponding to one of the data nodes in each of the second auxiliary subsets of data nodes.
Claim 4
Dependent Claim
45 words
The method of claim 1, wherein each data link is coupled to a flow link and wherein the data represented by the source and destination nodes of each data link corresponds to the sub-process which references the source and destination nodes of the flow link.
Claim 5
Dependent Claim
35 words
The method of claim 1, further including the step of generating a further link for interconnecting flow nodes in the first directed-acyclic graph representing additional data corresponding to a destination node of the further link.
Claim 6
Dependent Claim
29 words
The method of claim 1, wherein the first directed-acyclic graph forms a hierarchial model of the process by linking nodes representing one of sub-processes and sublinks of interlinked sub-processes.
Claim 7
Dependent Claim
28 words
The method of claim 5, further including the step of limiting the access of data generated by execution of the flow nodes to a user having predetermined characteristics.
Claim 8
Dependent Claim
29 words
The method of claim 1, further including the step of adding a feedback link to the first directed-acyclic graph to generate a directed graph having at least one cycle.
Claim 9
Dependent Claim
12 words
The method of claim 1, wherein the data is electrical engineering data.
Claim 10
Dependent Claim
12 words
The method of claim 1, wherein the data is mechanical engineering data.
Claim 11
Dependent Claim
12 words
The method of claim 1, wherein the data is software engineering data.
Claim 12
Dependent Claim
12 words
The method of claim 1, wherein the data is engineering process data.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-02-20 | 1998-08-22 | 1999-02-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-02-20 | 2002-08-22 | 2003-02-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-02-20 | 2006-08-22 | 2007-02-21 | $7700.00 | Window Closed / Lapsed |