Abstract
Datalog is a powerful query language for relational databases [10]. We consider the problems of determining containment, equivalence, and satisfiability of Datalog queries. We show that containment and equivalence are recursively unsolvable. This should be contrasted with the work of Aho, Sagiv, and Ullman on relational queries [1]. Satisfiability is easily decidable for Datalog quer ies. We also consider Datalog f which allows function symbols. Here, satisfiability is recursively unsolvable.
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.
