Patent US6052691A successfully refreshed from Google Patents.
US6052691A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Object relationship management system
Assignee: Intergraph Corp
•
Filing: 1997-09-24
•
Granted: 2000-04-18
•
Expires: 2017-09-24
Abstract
Abstract A method for maintaining relationships between entities in a computer system, each entity having a plurality nodes, includes the steps of: modifying one of the plurality of nodes; searching for a plurality of dependent nodes from the plurality of nodes coupled to the one node; ordering the plurality of dependent nodes into an order; and evaluating the plurality of dependent nodes in the order.
Inventors
- 👤 Jean-Louis Ardoin
- 👤 Richard M. Eade
- 👤 Robert Patience
- 👤 Alain Falasse
- 👤 Dave L. Brann
- 👤 Gerard J. Attilio
- 👤 Alfredo Arce
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 20:22
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/28; G06F16/284; G06F16/288; G06F16/23; G06F16/2365; G06F16/289; G06F16/90; G06F16/901; G06F16/9024; G06F2111/00; G06F2111/04; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99943; Y10S707/99944
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
64 words
A method for maintaining relationships between entities in a computer system, each entity having a plurality of nodes, the method comprising: modifying one of the plurality of nodes; searching for a plurality of dependent nodes from the plurality of nodes coupled to the one node; ordering the plurality of dependent nodes into an order; and evaluating the plurality of dependent nodes in the order.
Claim 2
Independent Claim
64 words
A method for maintaining relationships between entities in a computer system, each entity having a plurality of nodes, the method comprising: modifying one of the plurality of nodes; searching for a plurality of dependent nodes from the plurality of nodes coupled to the one node; ordering the plurality of dependent nodes into an order; and evaluating the plurality of dependent nodes in the order.
Claim 3
Dependent Claim
64 words
The method of claim 1, wherein the plurality of nodes comprises a plurality of value nodes and a plurality of function nodes, each of the plurality of function nodes having an evaluation function; and wherein the evaluating step comprises: identifying a second plurality of function nodes in the plurality of dependent nodes; and evaluating the evaluation functions of the second plurality of function nodes.
Claim 4
Dependent Claim
81 words
The method of claim 1, wherein the plurality of nodes comprises a plurality of value nodes and a plurality of predicate nodes, each of the plurality of predicate nodes having value nodes associated therewith; wherein the evaluating step comprises: identifying a second plurality of predicate nodes in the plurality of dependent nodes; identifying each of the second plurality of predicate nodes and associated value nodes; passing each predicate node and the associated value nodes to a solver; and solving the predicate.
Claim 5
Dependent Claim
21 words
The method of claim 3, wherein the solving step comprises: manipulating the associated value nodes until each predicate node is satisfied.
Claim 6
Dependent Claim
36 words
The method of claim 1, wherein the plurality of nodes comprises a plurality of value nodes and a plurality of function nodes; and wherein the modifying step comprises modifying one of the plurality of value nodes.
Claim 7
Dependent Claim
51 words
The method of claim 1, wherein the plurality of nodes comprises a plurality of value nodes and a plurality of function nodes, each of the plurality of function nodes having an evaluation function; and wherein the modifying step comprises modifying the evaluation function of one of the plurality of function nodes.
Claim 8
Dependent Claim
112 words
The method of claim 1, wherein the plurality of nodes comprises a plurality of value nodes, a plurality of function nodes, and a plurality of predicate nodes, each of the plurality of function nodes having value nodes in a parent and child dependency relation, each of the plurality of predicate nodes having value nodes in an equivalence relation; and wherein the searching step comprises: identifying nodes of the plurality of nodes directly coupled to the one node; identifying nodes of the plurality of nodes indirectly coupled to the one node as children of dependency relations; and identifying nodes of the plurality of nodes indirectly coupled to the one node in equivalence relations.
Claim 9
Dependent Claim
73 words
The method of claim 1, wherein the plurality of nodes comprises a plurality of value nodes, a plurality of function nodes, and a plurality of predicate nodes, each of the plurality of function nodes having value nodes in a parent and child dependency relation, each of the plurality of predicate nodes having value nodes in an equivalence relation; and wherein the ordering step further comprises ordering parent value nodes before children value nodes.
Claim 10
Independent Claim
98 words
A method for copying an entity from a plurality of entities in a computer system, and maintaining relationships of the entity, each of the plurality of entities having relationships with other entities, the method comprising: determining an entity of the plurality of entities to copy, the entity having a set of relationships; determining a domain of interest from the plurality of entities for the entity based upon the set of relationships; duplicating each entity in the domain of interest to form a set of entities; and establishing the set of relationships among each of the set of entities.
Claim 11
Independent Claim
98 words
A method for copying an entity from a plurality of entities in a computer system, and maintaining relationships of the entity, each of the plurality of entities having relationships with other entities, the method comprising: determining an entity of the plurality of entities to copy, the entity having a set of relationships; determining a domain of interest from the plurality of entities for the entity based upon the set of relationships; duplicating each entity in the domain of interest to form a set of entities; and establishing the set of relationships among each of the set of entities.
Claim 12
Dependent Claim
85 words
The method of claim 9, wherein the plurality of entities comprises a plurality of nodes, and a plurality of copy semantic nodes, each of the plurality of nodes having value nodes in a parent and child dependency relation with a copy semantic node; and wherein determining a domain comprises: identifying entities of the plurality of entities having nodes directly coupled to the entity; and identifying entities of the plurality of entities having nodes indirectly coupled to the entity as children of a copy semantic node.
Claim 13
Dependent Claim
25 words
The method of claim 10, wherein the step of identifying entities having nodes indirectly coupled to the entity is repeated for entities having transitive nodes.
Claim 14
Dependent Claim
51 words
The method of claim 9, wherein the duplicating step further comprises: determining whether each entity in the domain of interest must be duplicated; duplicating entities in the domain of interest that must be duplicated; and duplicating entities in the domain of interest that have no replacement in the plurality of entities.
Claim 15
Dependent Claim
19 words
The method of claim 9, further comprising establishing relationships between the set of entities and the plurality of entities.
Claim 16
Independent Claim
81 words
A method for deleting an entity from a plurality of entities in a computer system, each of the plurality of entities having relationships with other entities, the method comprising: determining an entity of the plurality of entities to delete, the entity having a set of relationships; determining a domain of interest from the plurality of entities for the entity based upon the set of relationships; and disconnecting each entity in the domain of interest from entities in the plurality of entities.
Claim 17
Independent Claim
81 words
A method for deleting an entity from a plurality of entities in a computer system, each of the plurality of entities having relationships with other entities, the method comprising: determining an entity of the plurality of entities to delete, the entity having a set of relationships; determining a domain of interest from the plurality of entities for the entity based upon the set of relationships; and disconnecting each entity in the domain of interest from entities in the plurality of entities.
Claim 18
Dependent Claim
81 words
The method of claim 14, wherein the plurality of entities comprises a plurality of value nodes, and a plurality of delete semantic nodes, each of the plurality of delete semantic nodes having value nodes in a parent and child dependency relation; and wherein determining a domain comprises: identifying entities of the plurality of entities having nodes directly coupled to the entity; and identifying entities of the plurality of entities having nodes indirectly coupled to the entity as children of dependency relations.
Claim 19
Dependent Claim
24 words
The method of claim 15, wherein the step of identifying entities having nodes indirectly coupled to the entity recurses for entities having transitive nodes.
Claim 20
Independent Claim
65 words
A method for reestablishing relationships between entities in a computer system, each entity having a plurality of nodes, the method comprising: maintaining a list of commands for a transaction; maintaining a batch list of nodes affected by each of the list of commands; creating relationships that were deleted between nodes; modifying relationships that were modified between nodes; and deleting relationships that were created between nodes.
Claim 21
Independent Claim
65 words
A method for reestablishing relationships between entities in a computer system, each entity having a plurality of nodes, the method comprising: maintaining a list of commands for a transaction; maintaining a batch list of nodes affected by each of the list of commands; creating relationships that were deleted between nodes; modifying relationships that were modified between nodes; and deleting relationships that were created between nodes.
Claim 22
Independent Claim
110 words
A method for creating, maintaining, and deleting relationships among a plurality of nodes of entities in a computer system, the plurality of nodes including value nodes, function nodes, predicate nodes, delete semantic nodes, and copy semantic nodes, the method comprising: providing a first entity; providing a second entity; establishing relationships between a plurality of nodes in the first entity; establishing relationships between the plurality of nodes in the first entity and a plurality of nodes in the second entity; deleting nodes in the first entity according to delete semantic nodes in the first entity; and copying nodes in the second entity according to copy semantic nodes in the second entity.
Claim 23
Independent Claim
110 words
A method for creating, maintaining, and deleting relationships among a plurality of nodes of entities in a computer system, the plurality of nodes including value nodes, function nodes, predicate nodes, delete semantic nodes, and copy semantic nodes, the method comprising: providing a first entity; providing a second entity; establishing relationships between a plurality of nodes in the first entity; establishing relationships between the plurality of nodes in the first entity and a plurality of nodes in the second entity; deleting nodes in the first entity according to delete semantic nodes in the first entity; and copying nodes in the second entity according to copy semantic nodes in the second entity.
References Cited (Backward Citations)
EP0360387A2
Cited
EP0422877A2
Cited
US5706506A
Cited
US5649190A
Cited
US5910804A
Cited
US5692184A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-04-18 | 2003-10-18 | 2004-04-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-04-18 | 2007-10-18 | 2008-04-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-04-18 | 2011-10-18 | 2012-04-18 | $7700.00 | Window Closed / Lapsed |