Computer-implemented method for translating among multiple representations and storage structures

• US 7,620,664 B2
• Filed: 12/31/2006
• Issued: 11/17/2009
• Est. Priority Date: 04/02/2002
• Status: Active Grant

• Current Assignee: David O. Mcgoveran
• Original Assignee: David O. Mcgoveran
• Inventors: McGoveran, David O.
• Primary Examiner(s): Wu; Yicun
• Assistant Examiner(s): Zhao; Yu
• Application Number:
  US11/649,089
• Publication Number:
  US 20080010235A1
• Time in Patent Office: 1,052 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99944 Object-oriented database structure
• CPC Class Codes: Y10S 707/99954 Version management

Abstract

This is a computer-implemented method for managing translating among, and understanding multiple representations and storage structures of data by accessing and updating physical storage through a relational representation. The present invention supports both data independence and automatic derivation of descriptions of data representations by manipulating membership abstractions in the logical representation, while the prior art is restricted to user-supplied denotations and catalog entries.

Claims

1. A method for merging, distributing, and versioning databases comprising:

selecting a set of source datastores and a set of target datastores;

identifying a first source datastore belong to the set of source datastores;

reading and acquiring a first source logical representation of the first source datastore;

formulating the first source logical representation as a collection of tables and constraints;

developing a first symbolic abstraction of the first source logical representation functionally equivalent to a first set of membership abstractions and constraints among them expressed as predicates;

identifying a first target datastore belonging to the first set of target datastores;

acquiring a first target logical representation of the first target datastore;

formulating the first target logical representation as a collection of tables and constraints;

developing a second symbolic abstraction of the first target logical representation functionally equivalent to a second set of membership abstraction and constraints among them expressed as predicates;

deriving from the second target symbolic abstraction a first set of derived membership abstractions and constraints among them which are equivalent to the first source symbolic abstraction;

deriving a first derived target logical representation consistent with the second target symbolic abstraction;

providing a set of access methods for reading and writing data having a logical representation as tables, to physical storage of the source and target datastores;

reading, using the set of access methods, a first set of data from the first source datastore using the first source logical representation to read, using the access methods, a first set of data from the first source datastore the first source logical representation;

deriving a set of write instructions for writing data to tables in the first target logical representation from the set of derived write instructions for writing data to tables in the first derived target logical representation; and

,

writing the first set of data to the first target datastore via tables in the first derived logical representation using the second set of write instructions.

2. A method as in claim 1 wherein the set of source datastores further comprises at least a second source datastore, and the first set of data is read from both the first source datastore and the second source datastore.

3. A method as in claim 1 wherein the set of target datastores further comprises at least a second target datastore and a first portion of the first set of data is written to the first target datastore and a second portion of the first set of data is written to the second target datastore.

4. A method as in claim 1 wherein the first source datastore'"'"'s physical location and the first target datastore'"'"'s physical location are one and the same.

5. A method as in claim 3 wherein the second target datastore is a new version of the source datastore.

6. A method as in claim 1 wherein at least one of the first source datastore and the first target datastore is managed by a non-relational DBMS.

7. A method as in claim 1 wherein at let one of the first source datastore and the first target datastore is managed by a commercial variant of a relational DBMS.

8. A method as in claim 1 wherein at least one of the first source datastore and the first target datastore is managed by a file management system.

9. A method as in claim 1 wherein the source datastore differs from the target datastore by at least one of physical representation, logical representation, physical location, file management system, and data management system.

10. A method as in claim 1 wherein the first set of data is destructively removed from source datastore, effectively transferring the first set of data to the first target datastore.

11. A method as in claim 1 wherein the source datastore and the target datastore have in common at least one of physical representation, logical representation, file management system, data management system, and physical location, the latter including being any combination of physically intermingled and physically co-located.

12. A method as in claim 1 wherein at least one source datastore data element is used to perform a modification operation on the target datastore, the modification operation being at least one of a set of actions comprising updating, deleting, and replacing and applied to at least one target datastore data element.

13. A method as in claim 1 wherein at least one source datastore data element is used to augment the target datastore.

14. A method as in claim 1 wherein at least one of the source datastore and the target datastore constitute a first distributed database, further comprising:

creating a common logical representation for both the source datastore and the target datastore; and

,

using the common logical representation to perform an operation on data in at least one of the source datastore and the target datastore, said operations including at least one operation of accessing and manipulating data.

15. A method as in claim 1 further comprising:

performing an operation on data in at least one of the source datastore and the target datastore, said operation including accessing and manipulating data in at least a first table; and

,

distinguishing the first table from at least a second table by differences in their respective membership abstractions. and affecting said operation according to said differences.