Abstract
Queries commonly perform much better if they manage to avoid duplicate elimination operations in their execution plans. In this paper, we report on a technique that provides a necessary and sufficient condition for removing such operators from object relational conjunctive queries under the standard duplicate semantics. The condition is fully captured as a membership problem in a dialect of description logic called CFD, which is capable of expressing a number of common constraints implicit in object relational database schemas. We also present a PTIME algorithm for arbitrary membership problems in CFD.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, 1995.
Alexander Borgida. Description logics in data management. IEEE Transactions on Knowledge and Data Engineering, 7(5):671–682, 1995.
Alexander Borgida and Peter F. Patel-Schneider. A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic. J. of AI Research, 1:277–308, 1994.
Alexander Borgida and Grant Weddell. Adding uniqueness constraints to description logics (preliminary report). In International Conference on Deductive and Object-Oriented Databases, pages 85–102, 1997.
Diego Calvanese, Giuseppe De Giacomo, and Maurizio Lenzerini. Answering Queries Using Views in Description Logics. In 6th International Workshop on Knowledge Representation meets Databases (KRDB’99), pages 6–10, 1999.
Diego Calvanese, Maurizio Lenzerini, and Daniele Nardi. Description logics for conceptual data modelling. In Jan Chomicki and Gunter Saake, editors, Logics for Databases and Information Systems, chapter 8. Kluwer, 1998.
Rick G. G. Cattell. ODMG-93: A Standard for Object-Oriented DBMSs. In A CM SIGMOD International Conference on Management of Data, page 480, 1994.
Rick G. G. Cattell, Douglas Barry, Dirk Bartels, Mark Berler, Jeff Eastman, Sophie Gamerman, David Jordan, Adam Springer, Henry Strickland, and Drew Wade. The Object Database Standard: ODMG 2.0. Morgan Kaufman, 1997.
Ashok K. Chandra and Philip M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In ACM Symposium on Theory of Computing, pages 77–90, 1977.
Surajit Chaudhuri and Moshe Y. Vardi. Optimization of real conjunctive queries. In ACM Symposium on Principles of Database Systems, pages 59–70, 1993.
Umeshwar Dayal. Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers. In 13th International Conference on Very Large Data Bases, pages 197–208, 1987.
Parke Godfrey, John Grant, Jarek Gryz, and Jack Minker. Integrity constraints: Semantics and applications. In Jan Chomicki and Gunter Saake, editors, Logics for Databases and Information Systems, chapter 9. Kluwer, 1998.
ISO. Database Language SQL. ISO/IEC 9075:1992, International Organization for Standardization, 1992.
Vitaliy L. Khizder. Uniqueness Constraints in Object-Relational Databases and Description Logics. PhD thesis, University of Waterloo, 1999.
Vitaliy L. Khizder, David Toman, and Grant Weddell. On Decidability and Complexity of Description Logics with Uniquwness Constraints. Technical report, Dept. of Computer Science, University of Waterloo, 2000. (submitted).
Alon Y. Levy, Inderpal Singh Mumick, and Yehoshua Sagiv. Query Optimization by Predicate Move-Around. In 20th International Conference on Very Large Data Bases, pages 96–107, 1994.
J. Melton and A. R. Simon. Understanding the new SQL: A Complete Guide. Morgan Kaufmann Publishers, 1993.
Inderpal Singh Mumick, Hamid Pirahesh, and Raghu Ramakrishnan. The Magic of Duplicates and Aggregates. In 16th International Conference on Very Large Data Bases, pages 264–277, 1990.
Glenn N. Paulley and Per-Åke Larson. Exploiting uniqueness in query optimization. In 10th International Conference on Data Engineering, pages 68–79, 1994.
Hamid Pirahesh, Joseph M. Hellerstein, and Waqar Hasan. Extensible/Rule Based Query Rewrite Optimization in Starburst. In ACM SIGMOD International Conference on Management of Data, pages 39–48, 1992.
Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, and Thomas G. Price. Access Path Selection in a Relational Database Management System. In ACM SIGMOD International Conference on Management of Data, pages 23–34, 1979.
Praveen Seshadri, Hamid Pirahesh, and T. Y. Cliff Leung. Complex Query Decorrelation. In 12th International Conference on Data Engineering, pages 450–458, 1996.
Martin F. van Bommel and Grant Weddell. Reasoning About Equations and Functional Dependencies on Complex Objects. IEEE Transactions on Knowledge and Data Engineering, 6(3):455–469, 1994.
Grant Weddell. Reasoning about Functional Dependencies Generalized for Semantic Data Models. ACM Transactions on Database Systems, 17(1):32–64, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khizder, V.L., Toman, D., Weddell, G. (2000). Reasoning about Duplicate Elimination with Description Logic. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_68
Download citation
DOI: https://doi.org/10.1007/3-540-44957-4_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67797-0
Online ISBN: 978-3-540-44957-7
eBook Packages: Springer Book Archive