Abstract
To recover from media failures, a database is ‘restored’ from an earlier backup copy. A recovery log of transactions is used to roll forward from the backup version to the desired time (the current time). High availability requires - backup activity to be fast, and on-line with ongoing update activity. Such concurrent generation of a database copy, interferes with system activity. It introduces blocking and delays for many update transactions. We study the performance of revised algorithms, to highlight the level of concurrent activity permitted by these algorithms, in parallel. Subsequently, the interference between global database copy activity and transaction updates is minimized based on a new algorithm for asynchronous generation of a copy of the database.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Amann, Sushil Jajodia, and Padmaja Mavuluri, “On-The-Fly Reading of Entire Databases”, IEEE Transactions of Knowledge and Data Engineering, Vol. 7, No. 5, October 1995, pp. 834–838.
P.A. Bernstein, V. Hadzilacos, and N. Goodman, “Concurrency Control and Recovery in Database Systems”, Addision-Wesley, 1987.
Eswaran, K.P., J.N. Gray, R.A. Lorie, and I.L. Traiger, “The Notion of consistency and predicate locks in a Database System, ” Communications of ACM, Vol. 19, Nov. 1976.
J. Gray, “Notes on Database Operating System”, IBM Technical report RJ2188 (Feb 1978), also LNCS Vol. 60, published by Springer-verlag.
D.B. Lomet, “High Speed On-line Backup When Using Logical Log Operations”, Proceedings of ACM SIGMOD Annual Conference in SIGMOD record, Vol. 29, No., 2, June 2000.
D.B. Lomet and and B. Salzberg, “Exploiting a History Database for Backup”, VLDB Conference, Dublin (Sept. 1993), 380–390.
Y. Ohtsuka, “Algorithms for Online Generation of Global Database Checkpoint”, Master’s Thesis, March 2000, University of Aizu, Fukushima, Japan, pp. 1–34.
C. Pu, “On-the-fly, incremental, consistent, reading of entire databases”, Algoritmica, Vol. 1, No. 3, pp. 271–287, Oct. 1986.
C. Pu, C.H. Hong, and J.M. Wha, “Performance Evaluation of global-reading of entire databases”, Proc. of Intl. Symposium on Databases in Parallel and Distributed Systems, pp. 167–176, Austin, Texas, Dec. 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhalla, S. (2000). Improving Parallelism in Asynchronous Reading of an Entire Database. In: Valero, M., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2000. HiPC 2000. Lecture Notes in Computer Science, vol 1970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44467-X_34
Download citation
DOI: https://doi.org/10.1007/3-540-44467-X_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41429-2
Online ISBN: 978-3-540-44467-1
eBook Packages: Springer Book Archive