Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2008-01-22
2008-01-22
Lovel, Kimberly (Department: 2167)
Data processing: database and file management or data structures
Database design
Data structure types
Reexamination Certificate
active
07321898
ABSTRACT:
A database system receives a transaction that causes a tuple to be integrated into a join view. In response to receiving the transaction, a predefined first lock is placed on at least a portion of the join view, the predefined first lock conflicting with either a shared lock or an exclusive lock placed on the join view, but not conflicting with another predefined first lock placed on the join view. Also, a latch or semaphore associated with a value of a predetermined attribute of the tuple is obtained before integrating the tuple into the join view.
REFERENCES:
patent: 5261069 (1993-11-01), Wilkinson et al.
patent: 5440732 (1995-08-01), Lomet et al.
patent: 5878410 (1999-03-01), Zbikowski 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: 6470360 (2002-10-01), Vaitheeswaran
patent: 6581205 (2003-06-01), Cochrane et al.
patent: 6606626 (2003-08-01), Ponnekanti
patent: 6668295 (2003-12-01), Chan
patent: 6687709 (2004-02-01), Williams
patent: 6709195 (2004-03-01), Borman et al.
patent: 6754656 (2004-06-01), Cornwell et al.
patent: 2003/0078922 (2003-04-01), Pham et al.
patent: 2003/0177131 (2003-09-01), Yamashita et al.
Goetz Graefe and Michael Zwilling. “Transaction Support for Indexed Summary Views.” SIGMOD 2004, Paris France.—provided in a previous Office Action.
Dallan Quass and Jenifer Widom. “On-Line Warehouse View Maintenance.” SIGMOND 1997: AZ, USA.—provided in a previous Office Action.
Rick Grehan, “How to Climb a 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, “TPFD 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).
R.F. Resende et al., “Sematic Locking in Object-Oriented Database Systems,”OOPSLA 1994: 388-402.
G. Luo et al., “Looking Protocols for Materialized Aggregate Join View,”VLDB 2003.
G. Luo et al., “A Comparison of Three Methods for Join View Maintenance in Parallel RDBMS,”ICDE 2003: 177-188.
D.B. Lomet, “Key Range Locking Strategies for Improved Concurrency,”VLDB 1993: 655-664.
B.R. Badrinath et al, “Semantics-Based Concurrency Control: Beyond Commutativity,” TODS pp. 163-199 (1992).
D. Gawlick et al., “Varieties of Concurrency Control in IMS/VS Fast Path,” Database Engineering Bulletin, pp. 3-10 (1985).
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).
A. Reuter, “Concurrency on High-traffic Data Elements,” PODS, pp. 83-92 (1982).
A. Silberschatz et al., “Consistency in Hierarchical Databases Systems,” JACM, pp. 72-80 (1980).
Ellmann Curt J.
Luo Gang
Naughton Jeffrey F.
Watzke Michael W.
Lovel Kimberly
NCR Corp.
Trop Pruner & Hu PC
LandOfFree
Locking mechanism for materialized views in a database system 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 materialized views in a database system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Locking mechanism for materialized views in a database system will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2813314