Patent US5893117A successfully refreshed from Google Patents.
US5893117A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Time-stamped database transaction and version management system
Assignee: Texas Instruments Inc
•
Filing: 1993-06-22
•
Granted: 1999-04-06
•
Expires: 2013-06-22
Abstract
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.
Inventors
- 👤 Chung Chian Wang
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 07:14
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/70; G06F8/71; G06F16/00; G06F16/20; G06F16/23; G06F16/2308; G06F16/2315; G06F16/2329; Y; Y10; Y10S; Y10S707/00; Y10S707/99951; Y10S707/99952; Y10S707/99954
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
107 words
A method for performing a cooperative transaction on a computer database associated with a plurality of users, comprising the steps of: automatically representing each version of an element of the database with a unique identifier, a timestamp, a branch name and a value; executing a plurality of threads for respective users of the cooperative transaction; defining branches associated with the versions; allowing users to create a new version of said element in response to an operation which would modify the element; allowing users to access versions of elements associated with other user's threads; and preventing other transactions from accessing versions of elements accessed by the cooperative transaction.
Claim 2
Independent Claim
107 words
A method for performing a cooperative transaction on a computer database associated with a plurality of users, comprising the steps of: automatically representing each version of an element of the database with a unique identifier, a timestamp, a branch name and a value; executing a plurality of threads for respective users of the cooperative transaction; defining branches associated with the versions; allowing users to create a new version of said element in response to an operation which would modify the element; allowing users to access versions of elements associated with other user's threads; and preventing other transactions from accessing versions of elements accessed by the cooperative transaction.
Claim 3
Dependent Claim
72 words
The method of claim 1 wherein said step of allowing users access comprises the step of: automatically locking a version of an element from other threads while the version of the element is being accessed by a first thread, such that the element cannot be accessed by other threads; and automatically releasing the lock as soon as the access is over, such that other threads may access the version of the element.
Claim 4
Dependent Claim
41 words
The method of claim 1 and further comprising the step of allowing a user to lock a version of an element of the database such that no other threads may append said new version to the locked version of the element.
Claim 5
Dependent Claim
45 words
The method of claim 1 and further comprising the step of allowing a user to lock a version of an element of the database such that said user is the only user that may append said new version to the locked version of the element.
Claim 6
Dependent Claim
45 words
The method of claim 1 and further comprising the step of allowing a user to append a lock to a version of an element of the database such that the user is notified whenever said new version is appended to the element by another user.
References Cited (Backward Citations)
US4646229A
Cited
US4677550A
Cited
US4558413A
Cited
US4814971A
Cited
US5008786A
Cited
US4714992A
Cited
US4714996A
Cited
US5008853A
Cited
US5193182A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-04-05 | 2002-10-05 | 2003-04-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-04-05 | 2006-10-05 | 2007-04-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-04-05 | 2010-10-05 | 2011-04-06 | $7700.00 | Window Closed / Lapsed |