Abstract
The containment and minimization of conjunctive queries are two basic problems of query optimization in relational and deductive databases. For equality queries, the problems are NP-complete due to the “homomorphism property”. For (in) equality queries, however, the containment problem has recently been proved to be π p 2-complete, while the minimization is virtually unknown. In this paper, we identify subclasses of (in) equality queries which have the homomorphism property and a similar minimization procedure to the one for equality queries. We also give interesting examples to show that queries outside these classes do not have the property.
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.
