Directed Graph Transitive Closure
AssigneeBMC Software, Inc.
InventorZack Milousheff
Life of this patent
Estimating the term…
Loading patent…
AssigneeBMC Software, Inc.
InventorZack Milousheff
Estimating the term…
Disclosed are methods and systems to provide for using database triggers to maintain a relational persistence of the transitive closure and path structure of an object hierarchy in the form of an object hierarchy bridge table. In one embodiment, database triggers fire when objects or relationships are added or deleted from the hierarchy. Based on the additions and deletions, a delta can be calculated and applied to an object hierarchy bridge table and the graph transitive closure and path structure can be dynamically built and maintained as corresponding changes to the graph occur. Later, more efficient access and retrieval of a graph transitive closure and path structure can be retrieved without necessarily having to perform recursion to calculate the graph transitive closure and path at request time.
A method of using one or more data tables to maintain an object transitive closure and path structure for a hierarchical relationship of objects, the method comprising:
A method of using one or more data tables in a database to maintain an object transitive closure and path structure for a hierarchical relationship of objects, the method comprising:
Dependencies are inferred from the claim text.