Schema agnostic migration of delineated data between relational databases
AssigneeMicrosoft Technology Licensing, LLC
InventorIgor Taranov
Life of this patent
Estimating the term…
Loading patent…
AssigneeMicrosoft Technology Licensing, LLC
InventorIgor Taranov
Estimating the term…
Initially, a database schema is parsed and a table tree structure is created delineating the relationships between data that are identified in the schema. In addition to accommodating relationships between main tables of data, the table tree structure also accommodates possible side tables of data, and possible circular references between tables, should such be encountered when parsing the schema. Subsequently, a migration mechanism consumes the generated table tree structure and iteratively migrates data in accordance therewith. Individual layers of the table tree structure are migrated consecutively with referenced layers being migrated prior to referencing layers. Circular links are accommodated through temporary null values, and side tables are accommodated during migration of the referencing main table. The iterative process provides completeness and fault tolerance/failure recovery.
One or more computer-readable storage media comprising computer-executable instructions, which, when executed by one or more processing units, cause one or more computing devices, in aggregate, to:
A method of migrating data from a source relational database to a destination relational database, the method comprising:
A computing device comprising:
Dependencies are inferred from the claim text.