Dynamic synchronization of tables

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

06529921

ABSTRACT:

FIELD OF THE INVENTION
This invention relates generally to database systems, and more particularly to dynamically synchronizing database tables among multiple networked computers.
COPYRIGHT NOTICE/PERMISSION
A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever. The following notice applies to the software and data as described below and in the drawings hereto: Copyright© 1998, Microsoft Corporation, All Rights Reserved.
BACKGROUND OF THE INVENTION
In a network in which multiple computers each process changes against the state of a shared entity, such as a database table, some mechanism must be employed to ensure that changes made on one computer will be reflected on all others. When a new computer is introduced into the network that needs a copy of the shared entity, there must be a way to load the data onto the new computer. In a static network in which a lock server or locking protocols are used to control the application of changes, the lock server or locking protocols force a quiescence period long enough for the data to be copied to the new computer. Consider the analogy of a meeting in which one participant is late. The meeting halts until the late person can be brought up to date.
However, in a dynamic network that requires that changes to the network configuration be made without impacting the processing of the computers already in the network, there needs to be a mechanism to copy the shared entity onto the new computer while changes are being made to the table on other computers. In addition, all those changes must be factored into the entity on the new computer before the computer is brought online.
SUMMARY OF THE INVENTION
The above-mentioned shortcomings, disadvantages and problems are addressed by the present invention, which will be understood by reading and studying the following specification.
Each node in a network accessing a common database caches a copy of the database tables it uses and updates those tables based on changes made by other nodes in a coherent cache, i.e., those node that also have a copy of the tables in their cache. When a new node joins the coherent cache, one of the existing nodes acts as a source to populate the table(s) required on the new (destination) node from its own copy using a dynamic synchronization method of the present invention. The dynamic synchronization method controls the population operation and allows for the populating of tables on the destination node from partially populated tables on the source node. The dynamic synchronization of the tables permits database updates to continue to be made to the tables by the existing nodes in the coherent cache and provides a mechanism to propagate the committed updates to the tables on the destination node. Once the tables on the destination node are fully populated, all pending updates are suspended while a snapshot of the state of the table on the source node is taken. After the destination node has processed the snapshot, transactions active on the source node that meet certain criteria are initiated on the destination node and transactions local to the destination node are applied to the table.
Using the meeting analogy mentioned above, the dynamic synchronization process is analogous to appointing one person to brief the late arrival while the meeting continues. Once the late person has been told what happened before he arrived, the briefer informs him of what happened while he was being briefed. Thus, the invention allows a dynamically changing table to be copied from one computer to another while still incorporating those changes, and without requiring that activity on the table be stopped for any significant period of time.
The present invention describes systems, clients, servers, methods, and computer-readable media of varying scope. In addition to the aspects and advantages of the present invention described in this summary, further aspects and advantages of the invention will become apparent by reference to the drawings and by reading the detailed description that follows.


REFERENCES:
patent: 4914569 (1990-04-01), Levine et al.
patent: 5544347 (1996-08-01), Yanai et al.
patent: 5832508 (1998-11-01), Sherman et al.
patent: 5835766 (1998-11-01), Iba et al.
patent: 5878410 (1999-03-01), Zbikowski et al.
patent: 5966706 (1999-10-01), Biliris et al.
patent: 5991771 (1999-11-01), Falls et al.
patent: 6029177 (2000-02-01), Sadiq et al.
patent: 6032158 (2000-02-01), Mukhopadhyay et al.
patent: 6122630 (2000-09-01), Strickler et al.
patent: 6157991 (2000-12-01), Arnon
patent: 6208990 (2001-03-01), Suresh et al.
patent: 6247038 (2001-06-01), Banks et al.
“TimesTen 3.7—In-Memory Database for 32-bit and 64-bit Operating Systems”, TimesTen Performance Software, http://www.timesten.com/products/ttdatasheet.html, 11 p., (Jun., 1999).
“TimeTen In-Memory Data Management—Technical White Paper”, Technical White Paper, TimesTen Performance Software, http://www.timesten.com/products/wp.html, 15 p., (2000).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Dynamic synchronization of tables does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic synchronization of tables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic synchronization of tables will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3008904

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.