← Back to Patent Explorer
US5966706A Expired / Lapsed US ⏱️ 0.0 years remaining

Local logging in a distributed database management computer system

Assignee: Nokia of America Corp
•
Filing: 1997-02-19
•
Granted: 1999-10-12
•
Expires: 2017-02-19
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A distributed database management computer system includes a plurality of nodes and a plurality of database pages. When a first node in the computer system updates a first database page, the first node generates a log record. The first node determines whether it manages the first database page. If the first node determines that it manages the first database page, the first node writes the log record to a log storage local to the first node. However, if the first node determines that it does not manage the first database page, the first node then determines whether it includes a local log storage. If the first node includes a local log storage, the first node writes the log record to the local log storage, even if the first node does not manage the first database page. If the first node does not include a local log storage, the first node sends the log record to a second node managing the first database page.

Inventors

  • 👤 Alexandros Biliris
  • 👤 Hosagrahar Visvesvaraya Jagadish
  • 👤 Euthimios Panagos
  • 👤 Rajeev R. Rastogi

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 09:11
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/23; G06F16/2358; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99932; Y10S707/99938; Y10S707/99941; Y10S707/99943

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 213 words
A method of operating a first node in a distributed database management computer system having a first set of database pages managed by the first node and a second set of database pages managed by a second node, wherein said first node can update pages in the first and second set, comprising the steps of: (a) updating a database page at the first node; (b) generating a first log record at the first node; (c) determining whether the first database page is managed by the first node; (d) if at step (c) it is determined that the first database page is managed by the first node, writing the first log record to a log storage local to the first node; and (e) if at step (c) it is determined that the first database page is not managed by the first node: (e-1) determining whether the first node includes a local log storage; (e-2) if at step (e-1) it is determined that the first node includes a local log storage, writing the first log record to the local log storage; and (e-3) if at step (e-1) it is determined that the first node does not include a local log storage, sending the first log record to a node that manages the first database page.
Claim 2
Independent Claim 213 words
A method of operating a first node in a distributed database management computer system having a first set of database pages managed by the first node and a second set of database pages managed by a second node, wherein said first node can update pages in the first and second set, comprising the steps of: (a) updating a database page at the first node; (b) generating a first log record at the first node; (c) determining whether the first database page is managed by the first node; (d) if at step (c) it is determined that the first database page is managed by the first node, writing the first log record to a log storage local to the first node; and (e) if at step (c) it is determined that the first database page is not managed by the first node: (e-1) determining whether the first node includes a local log storage; (e-2) if at step (e-1) it is determined that the first node includes a local log storage, writing the first log record to the local log storage; and (e-3) if at step (e-1) it is determined that the first node does not include a local log storage, sending the first log record to a node that manages the first database page.
Claim 3
Dependent Claim 72 words
The method of claim 1, wherein each of the plurality of nodes includes lock information, further comprising the steps of: (f) recovering from a failure of the first node by performing the following steps: (f-1) determining which of the plurality of database pages require recovery; (f-2) identifying which of the plurality of nodes are involved in the recovery; (f-3) reconstructing the lock information; and (f-4) coordinating the recovery among the involved nodes.
Claim 4
Dependent Claim 34 words
The method of claim 1, wherein the first node comprises a cache memory for buffering the log record and wherein either step (d) or step (e) is performed when said cache memory is full.
Claim 5
Dependent Claim 28 words
The method of claim 3, wherein either step (d) or step (e) is performed when the first database page is written to storage local to the first node.
Claim 6
Dependent Claim 27 words
The method of claim 3, wherein step (e) is performed when the first database page is sent to a second node that manages the first database page.
Claim 7
Dependent Claim 18 words
The method of claim 1, wherein either step (d) or step (e) is performed at a transaction commit.
Claim 8
Dependent Claim 217 words
A first node in a distributed database management computer system having a first set of database pages managed by the first node and a second set of database pages managed by a second node, wherein said first node can update pages in the first and second set, comprising: means for updating a first database page at the first node; means for generating a first log record at the first node; first means for determining whether the first database page is managed by the first node; first means for writing the first log record to a log storage local to the first node if said first means for determining determines that the first database page is managed by the first node; second means for determining whether the first node includes a local log storage if said first means for determining determines that the first database page is not managed by the first node; second means for writing the first log record to the local log storage if said second means for determining determines that the first node includes a local log storage; and means for sending the first log record to a a node that manages the first database page if said second means for determining determines that the first node does not include a local log storage.
Claim 9
Dependent Claim 217 words
A first node in a distributed database management computer system having a first set of database pages managed by the first node and a second set of database pages managed by a second node, wherein said first node can update pages in the first and second set, comprising: means for updating a first database page at the first node; means for generating a first log record at the first node; first means for determining whether the first database page is managed by the first node; first means for writing the first log record to a log storage local to the first node if said first means for determining determines that the first database page is managed by the first node; second means for determining whether the first node includes a local log storage if said first means for determining determines that the first database page is not managed by the first node; second means for writing the first log record to the local log storage if said second means for determining determines that the first node includes a local log storage; and means for sending the first log record to a a node that manages the first database page if said second means for determining determines that the first node does not include a local log storage.
Claim 10
Dependent Claim 75 words
The computer system of claim 7, wherein each of the plurality of nodes includes lock information, further comprising: means for recovering from a failure of the first node, said means for recovering comprising: means for determining which of the plurality of database pages require recovery; means for identifying which of the plurality of nodes are involved in the recovery; means for reconstructing the lock information; and means for coordinating the recovery among the involved nodes.

References Cited (Backward Citations)

US5261089A Cited
US5410684A Cited
US5448727A Cited
US5764877A Cited
US5446884A Cited
US5454102A Cited
US5764897A Cited
US5794229A Cited
US5687363A Cited
US5721909A Cited
US5530802A Cited
US5806065A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-10-11 2003-04-12 2003-10-12 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-10-11 2007-04-12 2007-10-12 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-10-11 2011-04-12 2011-10-12 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag