C. Mohan
Hamid Pirahesh
Raymond Lorie
Abstract
We present efficient and flexible methods which permit read-only transactions that do not mind reading a possibly slightly old, but still consistent, version of the data base to execute without acquiring locks. This approach avoids the undesirable interferences between such queries and the typically shorter update transactions that cause unnecessary and costly delays. Indexed access by such queries is also supported, unlike by the earlier methods. Old versions of records are maintained only in a transient fashion. Our methods are characterized by their flexibility (number of versions maintained and the timing of version switches, supporting partial rollbacks, and different recovery and buffering methods) and their efficiency (logging, garbage collection, version selection, and incremental, record-level versioning). Distributed data base environments are also supported, including commit protocols with the read-only optimization. We also describe efficient methods for garbage collecting unneeded older versions.
- AgSe89 AQrawal. D., Senoupta. S. Nodular Synchronization in HuZtlverslon Databases: Version ControZ and Concurrency Contro Z, Proc. SIGMOD International Conference on Management of Data, Portland, May 1989. Google Scholar
Digital Library
- BaHR80 Bayer, R., Heller, H., and Raiser, A. Parallelism end Recovery in Data base Systems, Transactions on Database Systems, Vol. 5, No. 2, June 1980. Google ScholarDigital Library
- BoCa92 Bober, P., Carey, M. On Htxfng Queries and Transactions Via Nulttverston Locking, Proc. 8th International Conference on Data Engineering, Tempe, February 1992. Google ScholarDigital Library
- ChGr85 Chan, A., Gray, R.Implementlng Olstrlbuted Read-Only Transact ions, IEEE Transactions on Software Engineer- Ing, Vol. SE-11, No. 2, February 1985.Google Scholar
- CFLN82 Chan, A., Fox, S., Un, W-T., Norl, A., and Ries, D. The impZementotton of An Integrated Concurrency Control end Recovery Scheme, Proc. SIGMOD International Conference on Management of Data, Orlando, June 1982. Google ScholarDigital Library
- GMBL81 Gray, J., McJones, P., Blasgen, M., Lindsay, B., Lorle, R., Price, T., Putzolu, F., Traiger, I. The Recovery Nonager of the System R Database Hanager, ACM Computing Surveys, Vol. 13, No. 2, June 1981. Google ScholarDigital Library
- MBCS91 Mohan, C., Britton, !<., Citron, A., Samaras, G. Generalized Presumed Abort: IVlarrying Presumed Abort and SNA's LU 6.2 Commit Protocols, IBM Research Report, IBM Almaden Research Center, November 1991.Google Scholar
- MHLPS92 Mohan, C., Haderle, D., Lindsay, B., Pirahesh, H., Schwarz, P. ARIES: A Transact ion Recovery Hethod Supporting Fine-GronuZortty Locking end Partial Rol Zbecks Using Write-Ahead Logging, ACM Transactions on Database Systems, Vol. 17, No. 1, March 1992. Also available as IBM Research Report RJ6849, IBM Almaden Research Center, January 1989. Google ScholarDigital Library
- Moha90a Mohan, C.ARIES/KVL: A Key-Value Locking Hethod }'or Concurrency Control of HuZttactton Transactions Operating on B-Tree Indexes, Proc. 16th International Conference on Very Large Data Bases, Brisbane, August 1990. A different version of this paper is available as IBM Research Report RJT00S, IBM Almaden Research Center, September 1989. Google ScholarDigital Library
- Moha90b Mohan, C. Commit LSN: A Novel and Simple Hethod for Reducing Locking and Latching in Transaction Processing Systems, Proc. 16th international Conference on Very Large Data Bases, Brisbane, August 1990. Also available as IBM Research Report RJ7344, IBM Almaden Research Center, February 1990. Google ScholarDigital Library
- MoLe92 Mohan, C., Levine, F. ARZES/IH: An Efficient and High Concurrency Index Hanogement Hethod Us tng Hrite-Ahead Logging, Proc. SIOMOD International Conference on Management of Data, San Diego, June 1992. A longer version is available as IBM Research Report RJ6846, IBM Almaden Research Center, August 1989. Google ScholarDigital Library
- MoLO86 Mohan, C., LJndsay, B., Obermarck, R. Transaction Henegement in the R* Distributed Oota Bose Henegement System, ACM Transactions on Database Systems, December 1986. Google ScholarDigital Library
- PMCLS90 Pirahesh, H., Mohan, C., Cheng, J., LJu, T.S., Sellnger, P. Parallelism in Relational Data Bose Systems: Archttectura! Issues and Design Approaches, Pro~. 2rid International Symposium on Databases in Parallel and Distributed Systems, Dublin, July 1990. A longer version is available as IBM Research Report RJ7724, IBM Almaden Research Center, October 1990. Google ScholarDigital Library
- RaRe91 Raghavan, A., Rengarajan, T.K. Database AvellabiZ try for Transact ion Processing, Digital Technical Journal, Vol. 3, No. 1, Winter 1991.Google Scholar
- Reed78 Reed, D. Naming and Synchronization in e OecentraZ ized Computer System, PhD Thesis, Technical Report MIT/LCS/TR-205, MIT, September 1978. Google ScholarDigital Library
- StRo81 Stearns, R.E., Rosenl<rantz, D.J. Distributed Database Concurrency Controls Ustno Before-Values, Proc. SIGMOD International Conference on Management of Data, Ann Arbor, April 1981. Google ScholarDigital Library
- Weih87 Weihl, W. Distributed Version Henogement for Read-OnZy Actions, IEEE Transactions on Software En. gineedng, Vol. SE-13, No. 1, January 1987. Google ScholarDigital Library
Index Terms
- Efficient and flexible methods for transient versioning of records to avoid locking by read-only transactions
Recommendations
Efficient and flexible methods for transient versioning of records to avoid locking by read-only transactions
SIGMOD '92: Proceedings of the 1992 ACM SIGMOD international conference on Management of dataWe present efficient and flexible methods which permit read-only transactions that do not mind reading a possibly slightly old, but still consistent, version of the data base to execute without acquiring locks. This approach avoids the undesirable ...
Implementing Distributed Read-Only Transactions
This paper presents an efficient scheme for eliminating conflicts between distributed read-only transactions and distributed update transactions, thereby reducing synchronization delays. The scheme makes use of a multiversion mechanism in order to ...
Comments