Abstract
One of the problems associated with running ad-hoc queries in an OLTP system is lock contention. Compensation-based query processing has been proposed as a solution to this problem. In this paper, undo/no-redo compensation is used to bring inconsistent copies of the base relations into a transaction-consistent state. Queries process the database internal log to obtain information on updates made by concurrent transactions. A performance analysis of the algorithm shows that it can be executed efficiently in an OLTP system with low to medium system utilization.
Supported by a grant from the Norwegian Research Council.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. M. Bober. Towards Practical Multiversion Locking Techniques for On-Line Query Processing. PhD thesis, University of Wisconsin — Madison, 1993.
P. M. Bober and M. J. Carey. On mixing queries and transactions via multiversion locking. In Proc. Int. Conf. Data. Eng., pages 535–545, Tempe, AZ, Feb. 1992.
D. DeWitt and J. Gray. Parallel database systems: The future of high performance database systems. Commun. ACM, 35(6):85–98, June 1992.
K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger. The notions of consistency and predicate locks in a database system. Commun. ACM, 19(11):624–633, Nov. 1976.
J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Mateo, CA, 1993.
Ø. Grøvlen, S.-O. Hvasshovd, and Ø. Torbjørnsen. On-line query processing through undo/no-redo compensation. In Proc. Int. Workshop on Advanced Transaction Models and Architectures, Goa, India, Sept. 1996. Available at http://www.idt.unit.no/~oysteing/papers/atma.ps.
S.-O. Hvasshovd. Recovery in Parallel Database Systems. VieWeg, Wiesbaden, Germany, 1996.
S.-O. Hvasshovd, Ø. Torbjørnsen, S. E. Bratsberg, and P. Holager. The ClustRa telecom database: High availability, high throughput, and real-time response. In Proc. Int. Conf. VLDB, pages 469–477, Zurich, Switzerland, Sept. 1995.
P. Mishra and M. H. Eich. Join processing in relational databases. ACM Comput. Surv., 24(1):63–113, Mar. 1992.
C. Mohan, H. Pirahesh, and R. Lorie. Efficient and flexible methods for transient versioning of records to avoid locking by read-only transactions. In Proc. ACM SIGMOD, pages 124–133, San Diego, CA, June 1992.
D. Quass and J. Widom. On-line warehouse view maintenace. In Proc. ACM SIGMOD, Tucson, AZ, May 1997.
V. Srinivasan and M. J. Carey. Compensation-based on-line query processing. In Proc. ACM SIGMOD, pages 331–340, San Diego, CA, June 1992.
K.-L. Wu, P. S. Yu, and M.-S. Chen. Dynamic finite versioning: An effective versioning approach to concurrent transaction and query processing. In Proc. Int. Conf. Data. Eng., pages 577–586, Vienna, Austria, Apr. 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grøvlen, Ø., Torbjørnsen, Ø., Hvasshovd, SO. (1997). Compensation-based query processing in on-line transaction processing systems. In: Small, C., Douglas, P., Johnson, R., King, P., Martin, N. (eds) Advances in Databases. BNCOD 1997. Lecture Notes in Computer Science, vol 1271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63263-8_3
Download citation
DOI: https://doi.org/10.1007/3-540-63263-8_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63263-4
Online ISBN: 978-3-540-69254-6
eBook Packages: Springer Book Archive