Schema agnostic migration of delineated data between relational databases
Abstract:
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.
Information query
Patent Agency Ranking
0/0