Managing storage of individually accessible data units

Details Managing storage of individually accessible data units Managing storage of individually accessible data units

2011-02-08

2011-02-08

Cottingham, John R. (Department: 2167)

Data processing: database and file management or data structures

File or database maintenance

Database backup

C707S706000, C707S802000, C711S161000, C711S162000

Reexamination Certificate

active

07885932

ABSTRACT:
Managing data includes: receiving at least one group of individually accessible data units over an input device or port, each data unit identified by a key value, with key values of the received data units being sorted such that the key value identifying a given first data unit that is received before a given second data unit occurs earlier in a sort order than the key value identifying the given second data unit; and processing the data units for storage in a data storage system. The processing includes: storing a plurality of blocks of data, each of one or more of the blocks being generated by combining a plurality of the data units; providing an index that includes an entry for each of the blocks, wherein one or more of the entries enable location, based on a provided key value, of a block that includes data units corresponding to a range of key values that includes the provided key value; and generating one or more screening data structures associated with the stored blocks for determining a possibility that a data unit that includes a given key value was included in the group of individually accessible data units.

REFERENCES:
patent: 4775932 (1988-10-01), Oxley et al.
patent: 5659733 (1997-08-01), Yamashita
patent: 5737593 (1998-04-01), Agrawal et al.
patent: 6278992 (2001-08-01), Curtis et al.
patent: 6873993 (2005-03-01), Charlesworth et al.
patent: 6970866 (2005-11-01), Pravetz et al.
patent: 6996573 (2006-02-01), Syvanne
patent: 2002/0052870 (2002-05-01), Charlesworth et al.
patent: 2002/0073096 (2002-06-01), Shaath et al.
patent: 2004/0049485 (2004-03-01), Obermaier et al.
patent: 2004/0236743 (2004-11-01), Blaicher et al.
patent: 2007/0005598 (2007-01-01), Okamoto et al.
patent: 2008/0015945 (2008-01-01), Goldstein
patent: 2008/0104149 (2008-05-01), Vishniac et al.
patent: 2009/0287986 (2009-11-01), Vishniac et al.
Douglas Comer, The Ubiquitous B-Tree, Jun. 1979.
Stanfill, Craig. “Massively Parallel Information Retrieval for Wide Area Information Servers,” Systems, Man, and Cybernetics, 1991. Decision Aiding for Complex Systems, Conference Proceedings, 1991 IEEE International Conference, Oct. 13-16, 1991, vol. 1, pp. 679-682.
International Search Report and Written Opinion issued in PCT application No. PCT/US2010/026817, dated May 10, 2010, 13 pages.
Chen, Z. et al., “Query Optimization in Compressed Database Systems”ACM SIGMODMay 21-24, 2001, Santa Barbara, California, USA.
Comer, Douglas, “The Ubiquitous B-Tree.”Computing Surveys, vol. 11, No. 2, Jun. 1979, pp. 121-137.

Affiliated with

Also associated with

Rating

Managing storage of individually accessible data units does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Managing storage of individually accessible data units, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Managing storage of individually accessible data units will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2634462