Abstract Each element of a database may have multiple versions; the versions are partitioned into branches, and versions of a branch are ordered linearly according to their timestamps. Branches are timestamped and related to one another by a version graph. Each version of an element of a database is represented by a unique identifier, a timestamp, a branch name and a value. A new version of an element associated with a branch is created in response to an operation associated with the branch which would modify the element. An object graph in the database is represented independent of the branches and version; an application coded for elements in one version (and branch) can be reused for the same elements in a different version and (different branch) without any re-coding effort. Methods for long duration transactions, cooperative transactions and schema evolutions are provided.
A method of managing versions and configurations of a plurality of objects comprising the steps of: providing a database which includes a plurality of data elements represented by four-tuples, said four-tuples comprising a unique identifier, a timestamp, a branch name, and a data value; generating a version graph which represents relationships among said elements; generating an object graph which represents a particular configuration of a portion of said elements; accessing said portion of said elements in said database in accordance with a first context, a second context, and said unique identifier in response to operations requested by an application program on said object graph using a storage manager.
Claim 2
Independent Claim
108 words
A method of managing versions and configurations of a plurality of objects comprising the steps of: providing a database which includes a plurality of data elements represented by four-tuples, said four-tuples comprising a unique identifier, a timestamp, a branch name, and a data value; generating a version graph which represents relationships among said elements; generating an object graph which represents a particular configuration of a portion of said elements; accessing said portion of said elements in said database in accordance with a first context, a second context, and said unique identifier in response to operations requested by an application program on said object graph using a storage manager.
Claim 3
Dependent Claim
55 words
The method of claim 1 wherein said accessing step includes the step of accessing said portion of said elements in said database where said unique identifier identifies an element on a particular branch of said version graph between a first branch identified by said first context and a second branch identified by said second context.
Claim 4
Dependent Claim
54 words
The method of claim 1 wherein said accessing step includes the step of accessing said portion of said elements in said database where said unique identifier identifies an element generated at a particular time which is between a first time associated with said first context and a second time associated with said second context.