A first approach to temporal predicate locking for concurrency detection in temporal relational databases supporting schema versioning

Abstract

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.