Relational database system and method with high data availabilit

Details Relational database system and method with high data availabilit Relational database system and method with high data availabilit

1996-04-12

1997-04-29

Amsbury, Wayne

Boots, shoes, and leggings

364DIG1, 3642821, G06F 1730

Patent

active

056258151

ABSTRACT:
A database computer system includes memory, residing in a plurality of interconnected computer nodes, for storing database tables. Each database table has a plurality of columns, a primary key index based on a specified subset of the columns, and an associated table schema. At least a subset of the database tables are partitioned into a plurality of partitions, each partition storing records having primary key values in a primary key range distinct from the other partitions. A transaction manager generates and stores an audit trail, each audit entry denoting a database table record event, such as an addition, deletion or alteration of a specified database table record in a specified one of said database tables. Four online data definition procedures allow the structure of a database table to be altered while the database table remains available to execution of transactions, with minimal impact of the availability of the database table for transaction execution. The four online data definition procedures are a move partition procedure, a split partition procedure, a move partition boundary procedure, and a create new index procedure. Each of these online procedures has three or four phases of execution. In a first phase, records of a table partition or the entire table are accessed using read only access, so as to generate a new partition, move records between two partitions, or to create a new index. In a second phase, audit trail entries are used to clean up the data structures created during the first phase. In a third phase, access to the database table is briefly locked while audit trail entries created after the second phase are used to make final changes to the data structures created during the first phase, and while the database table schema is updated to reflect the changes to the database table produced.

REFERENCES:
patent: 4853843 (1989-08-01), Ecklund
patent: 5333303 (1994-07-01), Mohan
patent: 5404508 (1995-04-01), Konrad et al.
patent: 5475837 (1995-12-01), Ishak et al.
"Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates"; C. Mohan et al.; Computer Science, RJ8016 (73664); Mar. 15, 1991; 20 pages.
"Performance of On-Line Index Construction Algorithms"; V. Srinivasan et al.; Computer Sciences Technical Report #1047; Computer Sciences Dept, Univ of Wisconsin, Madison; Sep. 1991; 25 pages.
"On-Line Index Construction Algorithms"; V. Srinivasan et al.; Proceedings of the High Performance Transaction Systems Workshop; Sep. 1991.
May 23, 1996, EPC Search Report.
Leslie, Harry, "Optimizing Parallel Query Plans and Execution", Intellectual Leverage, San Francisco, Feb. 25-Mar. 1, 1991, No. Conf. 36, 25 Feb. 1991, IEEE, pp. 105-109.

Affiliated with

Also associated with

Rating

Relational database system and method with high data availabilit does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Relational database system and method with high data availabilit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relational database system and method with high data availabilit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-714551