A first approach to temporal predicate locking for concurrency detection in temporal relational databases supporting schema versioning
Recently, a great deal of attention has been devoted to the problem of schema versioning. A possible solution [3, 7] maintains all the temporal intensional information in a unique “completed schemata” and all the underlying temporal data in a unique structure, here called “single-pool”. As in [3, 7], the data can be accessed through any schema version, thus the problem arises of the concurrency control of the access to the single-pool. A simple solution is here proposed that detects conflicts checking first the intensional and then, if needed, the extensional level.
KeywordsTemporal Data Intensional Concurrency Extensional Concurrency
Unable to display preview. Download preview PDF.
- 1.S. Ceri, G. Pelagatti, Distributed Databases: Principles and Systems, Mc Graw-Hill, 1985.Google Scholar
- 2.C. De Castro, “Temporal Conversion Functions for Multitemporal Relational Databases”, Proc. of 23rd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM '96), Brno Milovy, Czech Republic, 1996.Google Scholar
- 3.C. De Castro, F. Grandi,. M.R. Scalas, “On Schema Versioning in Temporal Databases”, Proc. of International Workshop on Temporal Databases, Zürich, Switzerland, 1995.Google Scholar
- 4.J. Gray, A. Reuter, Transaction Processing: Concepts and Technologies. Morgan Kaufmann Publishers, San Francisco, California, 1993.Google Scholar
- 5.M. Tamer Öszu, P. Valduriez, Principles of Distributed Database Systems, Prentice Hall International Inc., 1991.Google Scholar
- 6.A. Tansel, J. Clifford, V. Gadia, A. Segev, R. T. Snodgrass (eds), Temporal Databases: Theory, Design and Implementation.The Benjamin/Cummings Publishing Company, Redwood City, California, 1993.Google Scholar
- 7.R. T. Snodgrass (ed.) The TSQL2 Language Design Committee, The TSQL2 Temporal Query Language. Kluwer Ac.Pub., 1995.Google Scholar