System for representing and recreating object dependencies from one database system to another
Abstract
A system for recreating a plurality of database dependencies of objects from one database to another is disclosed. The system comprises categorizing the dependencies based upon at least one base object and formalizing the relationships of the dependencies based upon the categorization. The system includes determining the order of recreating the objects based upon the formalizing of the relationships of the dependencies. In a preferred embodiment, the system and method builds a Dependency Management Table (DMT) that describes the relationship of each object to a base-table. The DMT includes an entry for every object-to-object relationship, including the category of the relationship, and the nesting-level of the dependency from the base-table. Using this information, objects can be recreated in an order which ensures correct management of dependencies.
Claims
exact text as granted — not AI-modified1 . A computer program product comprising a computer readable medium containing program instructions for recreating a plurality of database dependencies of objects from one database to another database, the instructions for:
categorizing the dependencies based upon at least one base object, wherein dependencies include dependency classes of any of direct dependencies, nested dependencies, multi-level dependencies and up level/down level dependencies; formalizing the relationships of the dependencies based upon the categorizing step by building a dependency table having at least an entry for every object-to-object relationship, including a category of relationship, and nesting-level of the dependency from the base-table; and, determining the order of recreating the objects based upon the formalizing of the relationships of the dependencies.
2 . The computer program product of claim 1 wherein the at least one base object comprises a table within the database.
3 . The computer program product of claim 1 wherein the dependencies are categorized in the following manner:
providing Category A dependencies, wherein Category A dependencies are a down-level dependencies from the at least one base-object; providing Category B dependencies, wherein Category B dependencies are an up-level dependencies from the at least one base-object; and providing Category C dependencies, wherein Category C dependencies are a down-level dependencies from a Category B object.
4 . The computer program product of claim 3 wherein the categorizing step includes the step of enumerating a nest level of recursion of the dependency from the at least one base object.
5 . The computer program product of claim 4 wherein the order of recreating objects step comprises:
recreating Category A objects first, from a highest nestlevel to a lowest, by referencing the at least one base object; recreating Category C objects next, from a highest nestlevel to a lowest, by referencing the at least one base object, avoiding those objects which are already included in the Category A objects recreation; and recreating Category B objects last, from a lowest nestlevel to a highest, by referencing the at least one base object and avoiding those objects which are already included in the Category A object and the Category C object recreations.
6 . The computer program product of claim 5 wherein the formalizing step comprises building a Dependency Management Table which is derived from the categorizing and enumerating steps.
7 . A computer comprising:
a relational database management system, the relational management data system including a relational database system; the relational database system including at least two databases; and mechanisms for recreating a plurality of database dependencies of objects between the at least two databases; the mechanisms comprising categorizing the dependencies based upon at least one base object, wherein dependencies include dependency classes of any of direct dependencies, nested dependencies, multi-level dependencies and up level/down level dependencies; formalizing the relationships of the dependencies based upon the categorizing step by building a dependency table having at least an entry for every object-to-object relationship, including a category of relationship, and nesting-level of the dependency from the base-table; and, determining the order of recreating the objects based upon the formalizing of the relationships of the dependencies.
8 . The computer of claim 6 wherein the at least one base object comprises a table within the database.
9 . The computer of claim 6 wherein the dependencies are categorized in the following manner:
providing Category A dependencies, wherein Category A dependencies are a down-level dependencies from the at least one base-object; providing Category B dependencies, wherein Category B dependencies are an up-level dependencies from the at least one base-object; and providing Category C dependencies, wherein Category C dependencies are a down-level dependencies from a Category B object.
10 . The computer of claim 8 in which the categorizing mechanism includes the step of enumerating a nest level of recursion of the dependency from the at least one base object.
11 . The computer of claim 9 wherein the order of recreating objects mechanism comprises:
recreating Category A objects first, from a highest nestlevel to a lowest, by referencing the at least one base object; recreating Category C objects next, from a highest nestlevel to a lowest, by referencing the at least one base object, avoiding those objects which are already included in the Category A objects recreation; and recreating Category B objects last, from a lowest nestlevel to a highest, by referencing the at least one base object and avoiding those objects which are already included in the Category A object and the Category C object recreations.
12 . The computer of claim 8 wherein the formalizing step comprises building a Dependency Management Table which is derived from the categorizing and enumerating mechanisms.Join the waitlist — get patent alerts
Track US2009164511A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.