Providing traditional update semantics when updates change...

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

Reexamination Certificate

active

06886012

ABSTRACT:
Traditional update semantics are provided when updates change the location of records in a database. The system detects that an update to a record will cause the record to change locations in a database from an original location to an updated location. The system selectively prevents activity in the database between the original location and update location until the updated record has changed locations in the database from the original location to the updated location.

REFERENCES:
patent: 4914569 (1990-04-01), Levine et al.
patent: 4961139 (1990-10-01), Hong et al.
patent: 5175849 (1992-12-01), Schneider
patent: 5247672 (1993-09-01), Mohan
patent: 5276872 (1994-01-01), Lomet et al.
patent: 5285528 (1994-02-01), Hart
patent: 5440732 (1995-08-01), Lomet et al.
patent: 5455946 (1995-10-01), Mohan et al.
patent: 5485607 (1996-01-01), Lomet et al.
patent: 5485608 (1996-01-01), Lomet et al.
patent: 5511190 (1996-04-01), Sharma et al.
patent: 5519413 (1996-05-01), Thomas et al.
patent: 5522077 (1996-05-01), Cuthbert et al.
patent: 5551027 (1996-08-01), Choy et al.
patent: 5625815 (1997-04-01), Maier et al.
patent: 5630124 (1997-05-01), Coyle, Jr. et al.
patent: 5706494 (1998-01-01), Cochrane et al.
patent: 5717919 (1998-02-01), Kodavalla et al.
patent: 5717921 (1998-02-01), Lomet et al.
patent: 5737601 (1998-04-01), Jain et al.
patent: 5742806 (1998-04-01), Reiner et al.
patent: 5758344 (1998-05-01), Prasad et al.
patent: 5761659 (1998-06-01), Bertoni
patent: 5764877 (1998-06-01), Lomet et al.
patent: 5806065 (1998-09-01), Lomet
patent: 5835904 (1998-11-01), Vicik et al.
patent: 5960194 (1999-09-01), Choy et al.
patent: 6009425 (1999-12-01), Mohan
patent: 6070170 (2000-05-01), Friske et al.
patent: 6122644 (2000-09-01), Graefe et al.
patent: 6144983 (2000-11-01), Klots et al.
Mohan, C. “Aries/LHS: A Concurrency Control and Recovery Method Using Write-Ahead Logging for Linear Hashing with Separators”, Proceedings of the 9th International Conference on the Data Engineering, 1993, pp. 243-252.*
Mohan, C. “ARIES/KLV: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes”, Proceedings of the 16th very Large Database Conference, Aug. 1990, pp. 392-405.*
Lomet, D.B. “Key Range Locking Strategies for Improved Concurrency”, Proceedings of the 19thVery Large Database Conference, Aug. 24-27, 1993, pp. 655-664.*
Kornacker, M., Mohan, C., and Hellerstein, J.M. “Concurrency and Recovery in Generalized Search Trees”. Proceedings of the ACM SIGMOD International Conference on Management of Data, May 11-15, 1997, pp. 62-72.*
Mohan, C. “Disk Read-Write Optimizations and Data Integrity in Transaction Systems Using Write-Ahead Logging”. Proceedings of the Eleventh International Conference on Data Engineering, 1995. pp. 324-331.*
Mohan, C. “IBM's Relational DBMS Products: Features and Technologies”. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, May 25-28, 1993. pp. 445-448.*
Mohan, C. “Less Optimistic Concurrency Control”. Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing, 1992. pp. 199-204.*
Mohan, C. “Commit_LSN: A Novel and Simple Method for Reducing Locking and Latching in Transaction Processing System”. Proceedings of the Sixteenth Conference on Very Large Databases, Aug. 1990. pp. 406-418.*
Mohan, C. “ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes”. Proceedings of the Sixteenth Conference on Very Large Database, Aug. 1990, pp. 392-405.*
“Elimination of Lock Contention in Relational Databases Accessed by Read-Only Queries and On-Line Update Transactions”. IBM Technical Disclosure Bulletin, vol. 31, No. 1, Jun. 1998. pp. 180-185.*
“Integrated Concurrency and Shared Buffer Conherency Control for Multi-Systems”. IBM Technical Disclosure Bulletin, vol. 28, No. 10, Mar. 1986. pp. 4642-4650.*
“Shared Memory Management for Transaction Speed-Up in a Multi-System Environment”. IBM Technical Disclosure, vol. 28, No. 10, Mar. 1986. pp. 4520-4535.*
Kung, H.T., and Lehman, P.L. “Concurrent Manipulation of Binary Search Trees”. ACM Transactions on Database Systems, vol. 5, No. 3, Sep. 1980. pp. 354-382.*
Saigal, R., “Matrix Partitioning Methods for Interior Point Algorithms,” Sadhana, vol. 22, Pt. 4, Aug. 1997, IEE, 1998, pp. 575-587.
Research Document, “Partitioned Tables Unique Constraint Enforcement to Data-base Management—Providing Global Enforcement of Constraint if Same Key Value Appears in More Than One Partition,” RD-340009, Aug. 10, 1992.
IBM Technical Bulletin, “On-Line Data Redistribution in a Shared-Nothing Parallel Database System,” Vo. 40, No. 01, Jan. 1997, pp. 157-160.
Saigal, R., “Matrix Partitioning Methods for Interior Point Algorithms,” Sadhana, vol. 22, Pt. 4, Aug. 1997, IEE, 1998, pp. 575-587. * Abstract only.
Research Document, “Partitioned Tables Unique Constraint Enforcement to Data-base Management—Providing Global Enforcement of Constraint if Same Key Value Appears in More Than One Partition,” RD-340009, Aug. 10, 1992. * Abstract only.

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

Providing traditional update semantics when updates change... 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 traditional update semantics when updates change..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Providing traditional update semantics when updates change... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3384326

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