Abstract

In this paper, a concurrency control scheme based on the dependency among relations for deductive databases is proposed. According to relationship between the rules and the relations, we can build a dependency graph which includes relational predicates and gives correct information for concurrency control. We also extend the scheme to deductive object bases with the consideration of customized operations and semantic scheduling.

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 call

Disclaimer: 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.