Abstract
Concurrency control in deductive databases is an important issue which deserves much attention. In this paper we examine implementation of locking schemes. We adopt a model based on dependency graphs extended with compatibility trees, and describe features related to implementation of locking schemes in this model. Algorithms for read and write locking schemes are provided, and are illustrated by several examples. Although these algorithms are simple, they exemplify what are the unique problems of concurrency control that may be encountered in deductive databases, and how to deal with these problems.
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.
