Abstract
This paper addresses the problem of semantic query reformulation in the context of object-oriented deductive databases. It extends the declarative object-oriented specifications of F-logic proposed by Kifer and Lausen using the semantic query optimization technique developed by Chakravarthy, Grant, and Minker. In general, query processing in object-oriented databases is expensive when a query incorporates declarative rules, methods and inherited properties. We introduce the technique of semantic query reformulation for F-logic queries which transforms the original query into an equivalent, semantically-rich query that is more efficiently processed. We also discuss the issues of conflict resolution strategies and query evaluation priorities for queries involving the upper bounds of objects in the F-logic “type” lattice.
Preview
Unable to display preview. Download preview PDF.
References
A. Borgida. Type systems for query class hierarchies with non-strict inheritance. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 394–400, 1989.
Upen S. Chakravarthy, John Grant, and Jack Minker. Logic-based approach to semantic query optimization. ACM Transactions on Database Systems, 15(2):163–207, June 1990.
Georges Gardarin and Rosana S. Lanzelotte. Optimizing object-oriented database queries using cost-controlled rewriting. In Proc. of 3rd Int'l Conf. on Extending Database Technology, pages 534–549, Vienna, Austria, 1992.
Alfons Kemper and Guido Moerkotte. Advanced query processing in object bases using access support relations. In Proc. Intl. Conf. on Very Large Data Bases, pages 290–301, Brisbane, Australia, 1990.
Larry Kerschberg and Jong P. Yoon. Semantic query reformulation in object-oriented databases. In Proc. of the Workshop on Combining Declarative and Object-Oriented Databases, pages 73–85, Washington, D.C., 1993.
Michael Kifer and George Lausen. F-logic: A higher-order language for reasoning about objects, inheritance, and scheme. In Proc. ACM SIGMOD Intl. Conf. on Management of Data, pages 134–146, Portland, Oregon, 1989.
Sanggoo Lee, Lawrence J. Henschen, and Ghassan Z. Qadah. Semantic query reformulation in deductive databases. In Intl. Conf. on Data Engineering, pages 232–239, 1991.
A. Motro. Using integrity constraints to provide intensional answers to relational queries. In Proc. Intl. Conf. on Very Large Data Bases, pages 237–246, Amsterdam, 1989.
Inderpal S. Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, and Raghu Ramakrishnan. Magic is relevant. In Proc. ACM SIGMOD Intl. Conf. on Management of Data, pages 247–258. 1990.
Hamid Pirahesh, Joseph M. Hellerstein, and Waqar Hasan. Extensible/rule based query rewrite optimization in Starburst. In Proc. ACM SIGMOD Intl. Conf. on Management of Data, pages 39–48, 1992.
A. Pirotte and D. Roelants. Constraints for improving the generation of intensional answers in a deductive database. In 5th Int. Conf. on Data Engineering, pages 652–659, LA, 1989.
Kenneth A. Ross. Modular acyclicity and tail recursion in logic programs. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 92–101. 1990.
P. Griffiths Selinger and et al. Access path selection in a relational database management system. In Proc. ACM SIGMOD Intl. Conf. on Management of Data, pages 23–34, 1979.
Joseph E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. The MIT Press, Cambridge, MA, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoon, J.P., Kerschberg, L. (1993). Semantic query optimization in deductive object-oriented databases. In: Ceri, S., Tanaka, K., Tsur, S. (eds) Deductive and Object-Oriented Databases. DOOD 1993. Lecture Notes in Computer Science, vol 760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57530-8_10
Download citation
DOI: https://doi.org/10.1007/3-540-57530-8_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57530-6
Online ISBN: 978-3-540-48212-3
eBook Packages: Springer Book Archive