Abstract
Serializability requires that the execution of each transaction must give the illusion to be an atomic action, i.e., the execution of a set of transactions must appear to be a serial one. This requirement, however, is too strong and unnecessarily restricts concurrency among transactions, when semantic information is available for the transaction processing mechanism. In this paper, a new correctness criterion for concurrent execution of database transactions, denoted semantic serializability, is proposed. Semantic serializability is based on the use of semantic information about database objects (and not about transactions). The main idea of our proposal is to provide different atomicity views for each transaction and, for this reason, to allow interleavings among transactions which are nonserializable, but which preserve database consistency. We develop two concurrency control protocols, which are based on semantic serializability. One protocol is based on a locking-mechanism and the other one uses a non-locking approach. Our proposal is suitable to a wide variety of advanced database applications, such as CAx, MDBS, GIS and WFMS.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
