Patent US6502095B2 successfully refreshed from Google Patents.
US6502095B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Timestamp-based system and method for serializing lazy updates in a distributed database
Assignee: Nokia of America Corp
•
Filing: 1999-09-09
•
Granted: 2002-12-31
•
Expires: 2019-09-09
Abstract
Abstract A system for, and method of, ensuring serialization of lazy updates in a distributed database described by a directed acyclic copy graph. In one embodiment, the system includes: (1) a timestamp module that creates a unique timestamp for each of the lazy updates and (2) a propagation module, associated with the timestamp module, that employs edges of the directed acyclic copy graph to propagate the lazy updates among replicas in the distributed database according to said unique timestamp and ensure the serialization.
Inventors
- 👤 Yuri J. Breitbart
- 👤 Raghavan V. Komondoor
- 👤 Rajeev Rastogi
- 👤 Srinivasan Seshadri
- 👤 Abraham Silberschatz
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 10:57
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/27; Y; Y10; Y10S; Y10S707/00; Y10S707/964; Y10S707/966; Y10S707/99931; Y10S707/99938; Y10S707/99941; Y10S707/99943; Y10S707/99944; Y10S707/99945
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
72 words
A system for ensuring serialization of lazy updates in a distributed database described by a directed acyclic copy graph, comprising: a timestamp module that creates a unique timestamp for each of said lazy updates; and a propagation module, associated with said timestamp module, that employs edges of said directed acyclic copy graph to propagate said lazy updates among replicas in said distributed database according to said unique timestamp and ensure said serialization.
Claim 2
Independent Claim
72 words
A system for ensuring serialization of lazy updates in a distributed database described by a directed acyclic copy graph, comprising: a timestamp module that creates a unique timestamp for each of said lazy updates; and a propagation module, associated with said timestamp module, that employs edges of said directed acyclic copy graph to propagate said lazy updates among replicas in said distributed database according to said unique timestamp and ensure said serialization.
Claim 3
Dependent Claim
32 words
The system as recited in claim 1 wherein said unique timestamp is a function of relationships between each of said lazy updates and a site location within said directed acyclic copy graph.
Claim 4
Dependent Claim
22 words
The system as recited in claim 1 wherein said unique timestamp is augmented for each sub-transaction to serialize updates to said replicas.
Claim 5
Dependent Claim
36 words
The system as recited in claim 1 wherein said timestamp module creates a lexicographic ordering of tuples for said directed acyclic copy graph and said unique timestamp is a function of said lexicographic ordering of tuples.
Claim 6
Dependent Claim
24 words
The system as recited in claim 1 wherein said propagation module serializes said lazy updates as a function of a lexicographic ordering of tuples.
Claim 7
Dependent Claim
15 words
The system as recited in claim 1 wherein said unique timestamp is a tuple vector.
Claim 8
Dependent Claim
22 words
The system as recited in claim 1 wherein a counterpart of said system is located at each replica of said distributed database.
Claim 9
Independent Claim
59 words
A method of ensuring serialization of lazy updates in a distributed database described by a directed acyclic copy graph, comprising: creating a unique timestamp for each of said lazy: updates; and employing edges of said directed acyclic copy graph to propagate said lazy updates among replicas in said distributed database according to said unique timestamp and ensure said serialization.
Claim 10
Independent Claim
59 words
A method of ensuring serialization of lazy updates in a distributed database described by a directed acyclic copy graph, comprising: creating a unique timestamp for each of said lazy: updates; and employing edges of said directed acyclic copy graph to propagate said lazy updates among replicas in said distributed database according to said unique timestamp and ensure said serialization.
Claim 11
Dependent Claim
32 words
The method as recited in claim 8 wherein said unique timestamp is a function of relationships between each of said lazy updates and a site location within said directed acyclic copy graph.
Claim 12
Dependent Claim
22 words
The method as recited in claim 8 wherein said unique timestamp is augmented for each sub-transaction to serialize updates to said replicas.
Claim 13
Dependent Claim
36 words
The method as recited in claim 8 wherein said creating comprises creating a lexicographic ordering of tuples for said directed acyclic copy graph and said unique timestamp is a function of said lexicographic ordering of tuples.
Claim 14
Dependent Claim
24 words
The method as recited in claim 8 wherein said employing comprises serializing said lazy updates as a function of a lexicographic ordering of tuples.
Claim 15
Dependent Claim
15 words
The method as recited in claim 8 wherein said unique timestamp is a tuple vector.
Claim 16
Dependent Claim
20 words
The method as recited in claim 8 wherein said method is carried out at each replica of said distributed database.
Claim 17
Dependent Claim
97 words
A distributed database described by a directed acyclic copy graph, comprising: at least one primary site; at least two secondary sites; and a system for ensuring serialization of lazy updates among said at least one primary site and said at least two secondary sites, including: a timestamp module that creates a unique timestamp for each of said lazy updates, and a propagation module, associated with said timestamp module, that employs edges of said directed acyclic copy graph to propagate said lazy updates among replicas in said distributed database according to said unique timestamp and ensure said serialization.
Claim 18
Dependent Claim
97 words
A distributed database described by a directed acyclic copy graph, comprising: at least one primary site; at least two secondary sites; and a system for ensuring serialization of lazy updates among said at least one primary site and said at least two secondary sites, including: a timestamp module that creates a unique timestamp for each of said lazy updates, and a propagation module, associated with said timestamp module, that employs edges of said directed acyclic copy graph to propagate said lazy updates among replicas in said distributed database according to said unique timestamp and ensure said serialization.
Claim 19
Dependent Claim
33 words
The distributed database as recited in claim 15 wherein said unique timestamp is a function of relationships between each of said lazy updates and a site location within said directed acyclic copy graph.
Claim 20
Dependent Claim
23 words
The distributed database as recited in claim 15 wherein said unique timestamp is augmented for each sub-transaction to serialize updates to said replicas.
Claim 21
Dependent Claim
37 words
The distributed database as recited in claim 15 wherein said timestamp module creates a lexicographic ordering of tuples for said directed acyclic copy graph and said unique timestamp is a function of said lexicographic ordering of tuples.
Claim 22
Dependent Claim
25 words
The distributed database as recited in claim 15 wherein said propagation module serializes said lazy updates as a function of a lexicographic ordering of tuples.
Claim 23
Dependent Claim
16 words
The distributed database as recited in claim 15 wherein said unique timestamp is a tuple vector.
Claim 24
Dependent Claim
23 words
The distributed database as recited in claim 15 wherein a counterpart of said system is located at each replica of said distributed database.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-12-30 | 2006-07-01 | 2006-12-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-12-30 | 2010-07-01 | 2010-12-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-12-30 | 2014-07-01 | 2014-12-31 | $7700.00 | Window Closed / Lapsed |