Locking mechanism using a predefined lock for materialized...

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

07149737

ABSTRACT:
A database system includes a locking mechanism for a materialized view defined on base relations. In response to updates of a base relation, a predefined lock (e.g., Y lock or IY lock) is placed on the materialized view. With the locking mechanism, transaction concurrency is enhanced by enabling concurrent updates of a materialized view by plural transactions in certain cases.

REFERENCES:
patent: 5261069 (1993-11-01), Wilkinson et al.
patent: 5581750 (1996-12-01), Haderle et al.
patent: 5983215 (1999-11-01), Ross 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: 6687709 (2004-02-01), Williams
patent: 6708195 (2004-03-01), Borman et al.
patent: 6754656 (2004-06-01), Cornwell et al.
Oracle9i Data Warehousing Guide, Release 9.0.1, Jun. 2001, Oracle.
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 (dated as early as Jan. 8, 2003).
Kevin Jones, “TPFDF B+Tree Indexing Support,” printed from http://www-3.ibm.com, pp. 1-3 (dated 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 as early as Jan. 8, 2003).
Gang Luo et al., “Locking Protocols for Materialized Aggregate Join Views,” pp. 1-11 (Jun. 2003).
B.R. Badrinath et al, “Semantics-Based Concurrency Control: Beyond Commutativity,” TODS pp. 163-199 (1992).
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-411, 413, 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).
H.F. Korth, “Locking Primitives in a Database System,” JACM pp. 55-79 (1983).
W. Labio et al., “Performance Issues in Incremental Warehouse Maintenance,” VLDB pp. 461-472 (2000).
P.E. O'Neil, “The Escrow Transactional Method,” TODS pp. 405-430 (1986).
M. Poess et al. “New TPC Benchmarks for Decision Support and Web Commerce,” SIGMOD pp. 64-71 (2000).
R.F. Resende et al., “Semantic Locking in Object-Oriented Database Systems,” OOPSLA, pp. 388-402 (1994).
A. Reuter, “Concurrency on High-traffic Data Elements,” PODS, pp. 83-92 (1982).
M. Komacker et al, “Concurrency and Recovery in Generalized Search Trees,” SIGMOD pp. 62-72 (1997).
D.B. Lomet, “Key Range Locking Strategies for Improved Concurrency,” VLDB pp. 655-644 (1993).
C. Mohan, “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).

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 using a predefined lock for materialized... 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 using a predefined lock for materialized..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Locking mechanism using a predefined lock for materialized... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3666471

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