Providing a useable version of a data item

Details Providing a useable version of a data item Providing a useable version of a data item

2005-10-18

2005-10-18

Mizrahi, Diane D. (Department: 2165)

Data processing: database and file management or data structures

Database design

Data structure types

Reexamination Certificate

active

06957236

ABSTRACT:
Techniques are provided for providing a data item to a transaction in a multi-versioning system in which the data item may exist on multiple versions of a data block, and were versioning is performed at the granularity of the data block. According to one aspect of the invention, the technique involves locating, within volatile memory, a first version of a data block that includes a first version of the data item. It is then determined whether the first version of the data item is useable by the transaction without respect to whether the first version of the data block is generally useable by the transaction. If the first version of the data item is usable by the transaction, then the data item is established as a candidate that can be provided to the transaction. Thus, the data item within a block may be considered a candidate to be provided to a transaction even when the version of the data block on which the data item resides would otherwise disqualify the data block from being seen by that transaction. If the first version of the data item is not usable by the transaction, then a version of the data item that is usable by the transaction is obtained from a second version of the data block that is different from the first version.

REFERENCES:
patent: 5794228 (1998-08-01), French et al.
patent: 5794229 (1998-08-01), French et al.
patent: 5806076 (1998-09-01), Ngai et al.
patent: 5857207 (1999-01-01), Lo et al.
patent: 5870764 (1999-02-01), Lo et al.
patent: 5873098 (1999-02-01), Bamford et al.
patent: 6192377 (2001-02-01), Ganesh et al.
patent: 6237001 (2001-05-01), Bamford et al.
patent: 6256748 (2001-07-01), Pinson
patent: 6564215 (2003-05-01), Hsiao et al.
patent: 6606660 (2003-08-01), Bowman-Amuah
patent: 6772155 (2004-08-01), Stegelmann
patent: 6845384 (2005-01-01), Bamford et al.
Luciano Lenzini et al., Trade-offs between low complexity, low latency, and fairness with deficit round-round schedulers, 8-200 ACM Press, vol. 12, Issue 4, IEEE/ACM Transactions on Networking (TON), pp. 681-693.
D. Kim et al., Leveraging cache coherence in active memory systems, 2002, ACM Press, Inter. Conference on Supercomputin pp. 2-13.
Dr. Richard Taylor, “Concurrency in the Data Warehouse,” Proceedings of the 26thInternational Conference on Very Large Databases, Cairo, Egypt, 2000, XP-002254905, pp. 724-727.

Affiliated with

Also associated with

Rating

Providing a useable version of a data item does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Providing a useable version of a data item, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Providing a useable version of a data item will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3469088