Rescheduling transactions in a database system

Details Rescheduling transactions in a database system Rescheduling transactions in a database system

2006-01-24

2006-01-24

Mizrahi, Diane D. (Department: 2165)

Data processing: database and file management or data structures

Database design

Data structure types

Reexamination Certificate

active

06990503

ABSTRACT:
A database system includes a transaction rescheduling mechanism that reorders pending transactions based on whether one or more of the pending transactions conflict with any transactions that have been scheduled for execution. In one arrangement, the received pending transactions are stored in a first queue. The transactions that are scheduled for execution are stored in a second queue. The transactions are moved from the first queue to the second queue based on the reordering by the transaction rescheduling mechanism.

REFERENCES:
patent: 5832508 (1998-11-01), Sherman et al.
patent: 6243778 (2001-06-01), Fung et al.
patent: 6339772 (2002-01-01), Klein et al.
patent: 6397227 (2002-05-01), Klein et al.
patent: 6453313 (2002-09-01), Klein et al.
patent: 6604102 (2003-08-01), Klein et al.
patent: 2002/0038313 (2002-03-01), Klein et al.
R.Ronngren et al., Lazy queue:an efficient implementation of the pending-event set, 1991, Proc. Of 24th Ann. Symp. on Sim.,IEEE Computer Society Press, pp. 194-204.
Ravi Rajwar et al., Transactional lock-free execution of lock-based programs, 2002, Proc. Of the 10th Intern. Conf on Architectural Support for programming, Multiprocessor synchronization and speculation, ACM Press, NY, pp. 5-17.
Gang Luo et al., U.S. Appl. No. 10/121,191, entitled “Transaction Grouping and Reschedualing in a Database System,” filed Apr. 12, 2002, pp. 1-80, Figs. 1-33.
Gang Luo et al., U.S. Appl. No. 10/117,503, entitled “Locking Mechanism Employing a Name Lock for Materialized Views,” filed Apr. 4, 2004, pp. 1-53, Figs. 1-18.
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. 18, 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 Aggergate 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. Grey 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. Kornacker 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).

Affiliated with

Also associated with

Rating

Rescheduling transactions 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 Rescheduling transactions in a database system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rescheduling transactions in a database system will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3594157