Locking mechanism for views associated with B-tree indexes

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

C707S793000, C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

10349855

ABSTRACT:
A database system includes a locking mechanism for a view defined on one or more base relations. A B-tree index is defined on the view. In response to updates of a base relation, predefined locks are placed on the view. With locking mechanisms according to some embodiments of the invention, concurrency of transactions that access the view and B-tree index is enhanced by enabling concurrent updates of the materialized view by plural transactions in certain cases, while avoiding read-write and write-read conflicts.

REFERENCES:
patent: 5764976 (1998-06-01), Hsiao
patent: 5983215 (1999-11-01), Ross et al.
patent: 6144983 (2000-11-01), Klots et al.
patent: 6353828 (2002-03-01), Ganesh et al.
patent: 6353835 (2002-03-01), Lieuwen
patent: 6581205 (2003-06-01), Cochrane et al.
patent: 6668295 (2003-12-01), Chan
patent: 6683291 (2004-01-01), Barchers
patent: 6687709 (2004-02-01), Williams
patent: 6708195 (2004-03-01), Borman et al.
Rick Grehan, “How to Climb a B-tree: B-tree, a popular tree-indexing structure, is perfect for db4o database system, and can save you a lot of disk access time,” printed from http://www.fawcette.com, 25 pages (2002).
Kevin Jones, “TPFDF B+ Tree Indexing Support,” printed from http://www-3.ibm.com, pp. 1-3 (dated at least as early as Jan. 8, 2003).
SAP Library-User Manual: SAP DB, “B*Tree,” printed from http://pipin.tmd.ns.ac.yu, pp. 1-2 (dated at least as early as Jan. 8, 2003).
J. Gehrke, et al. “On Computing Correlated Aggregates over Continual Data Streams.” SIGMOD Conf. pp. 13-24 (2001).
J. Gray, et al., “Granularity of Locks and Degrees of Consistency in a Shared Data Base.” IFIP Working Conference on Modeling in Data Base Management Systems, pp. 365-394 (1976).
J. Gray, et al., “Transaction Processing:Concepts and Techniques.” Morgan Kaufmann Publishers, pp. 403-406, 409-414, 419, 428, 429, 456-458, 464-481, 848-851, 868-872 (1993).
A. Kawaguchi, et al. “Concurrency Control Theory for Deferred Materialized Views.” ICDT, pp. 306-320 (1997).
M. Kornacker, et al., “Concurrency and Recovery in Generalized Search Trees.” SIGMOD Conf., pp. 67-72 (1997).
H.F. Korth “Locking Primitives in a Database System.” JACM 30(1), pp. 55-79 (1983).
C. Mohan, et al., “ARIES/IM:An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging.” SIGMOD Conf., pp. 371-380 (1992).
C. Mohan “ARIES/KVL: A key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes.” VLDB, pp. 392-405, (1990).
C. Mohan “Commit—LSN: A Novel and Simple Method for Reducing Locking and Latching in Transaction Processing Systems.” VLDB, pp. 406-418 (1990).
C. Mohan, “ARIES/LHS: A Concurrency Control and Recovery Method Using Write-Ahead Logging for Linear Hashing with Separators.” ICDE, pp. 243-252 (1993).

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

Locking mechanism for views associated with B-tree indexes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Locking mechanism for views associated with B-tree indexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Locking mechanism for views associated with B-tree indexes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3854384

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