Peephole DBMS reorganization allowing concurrent data...

Details Peephole DBMS reorganization allowing concurrent data... Peephole DBMS reorganization allowing concurrent data...

2005-12-19

2009-10-13

Vo, Tim T. (Department: 2168)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000

Reexamination Certificate

active

07603336

ABSTRACT:
A method, apparatus and program storage device readable by a computer tangibly embodying a program of instructions executable by the computer is provided for reorganization of database data. The computer database reorganization method reorganizes one set of database data blocks at a time, allowing concurrent data manipulation. Method identifies a set of data blocks for reorganization in a sliding peephole mode, re-orders the set of data blocks and replaces the original set of data blocks with the re-ordered set of data blocks. The method include an overlapping peephole method, which chooses, for each set of data block to be reorganized, a next succeeding set of data blocks plus an overlap segment, wherein the overlap segment includes a set of empty pages other than intentionally specified free pages, and the overlap segment is a subset of the preceding set of data blocks.

REFERENCES:
patent: 5222235 (1993-06-01), Hintz et al.
patent: 5495601 (1996-02-01), Narang et al.
patent: 6026412 (2000-02-01), Sockut et al.
patent: 6453404 (2002-09-01), Bereznyi et al.
patent: 6499039 (2002-12-01), Venkatesh et al.
patent: 6519613 (2003-02-01), Friske et al.
patent: 6606631 (2003-08-01), Martin, Jr. et al.
patent: 6622142 (2003-09-01), Murray et al.
patent: 6871295 (2005-03-01), Ulrich et al.
patent: 7366727 (2008-04-01), Heusermann et al.
patent: 2002/0143743 (2002-10-01), Iyer et al.
patent: 2002/0198860 (2002-12-01), Smith
patent: 2003/0135478 (2003-07-01), Marshall et al.
patent: 2004/0215632 (2004-10-01), Isip et al.
patent: 2005/0027729 (2005-02-01), Kuchinsky et al.
patent: 2005/0270856 (2005-12-01), Earhart et al.
patent: 2006/0004951 (2006-01-01), Rudelic et al.
patent: 2006/0047719 (2006-03-01), Hershkovich et al.
Ding, C. et al.; Improving Cache Performance in Dynamic Applications through Data and Computation Reorganization at Run Time, 1999, ACM 1-58113-083-X/99/0004.
Palem, K. V. et al.; Design Space Optimization of Embedded Memory Systems via Data Remapping, 2002, ACM 1-58113-527-0/02/0006.
Luk, C-K, et al.; Memory Forwarding: Enabling Aggressive Layout Optimizations by Guaranteeing the Safety of Data Relocation, 1999, IEEE 1063-6897/99.
Scheuermann, P. et al.: Data Partitioning and Load Balancing in Parallel Disk Systems, 1998, Spring-Verlag.
PCT International Search Report, Mar. 19, 2007.
Sockut, G. et al.; Database Reorganization—Principles and Practice, 1979, ACM Computing Surveys, vol. 11, No. 4, Dec. 1979, pp. 371-395, XP002217091.

Affiliated with

Also associated with

Rating

Peephole DBMS reorganization allowing concurrent data... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Peephole DBMS reorganization allowing concurrent data..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Peephole DBMS reorganization allowing concurrent data... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4087399