Abstract
Most deductive databases impose restrictions on the terms that can be used in them: they require that generated tuples be fully ground, i.e. contain no variables. Without this restriction, query evaluation of general programs needs subsumption tests in order to terminate correctly, and subsumption tests are expensive.
We study a class of programs that can handle terms with both variables and function symbols but for which subsumption tests are not necessary. This class is based on the notion of modes, which generalise adornments by not requiring that “bound” be synonymous with “ground”. We show how programs in this class may be recognized and how they should be transformed into an executable form, and then prove that bottom-up evaluation of the resulting programs does not require subsumption tests.
We would like to thank Will Winsborough for conversations that clarified some of the concepts in section 2, the referees for their comments, and the Australian Research Council and Centre for Intelligent Decision Systems for their support.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
F. Bancilhon, D. Maier, Y. Sagiv, and R. Ramakrishnan. Magic sets and other strange ways to implement logic programs. Proceedings of the Symposium on Principles of Database Systems, pages 1–15, 1986.
P. M. Hill and J. W. Lloyd. The Gödel report. Technical Report 91-02, Department of Computer Science, University of Bristol, England, 1991.
D. Kemp, K. Ramamohanarao, and Z. Somogyi. Right-, left-and multi-linear rule transformations that maintain context information. In Proceedings of the Sixteenth International Conference on Very Large Data Bases, pages 380–391, Brisbane, Australia, 1990.
R. Milner. A proposal for standard ML. Conference Record of the ACM Symposium on LISP and Functional Programming, pages 184–197, 1984.
A. Mycroft and R. A. O'Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295–307, 1984.
R. Ramakrishnan, P. Bothner, D. Srivastava, and S. Sudarshan. CORAL — a database programming language. In Proceedings of the NACLP '90 Workshop on Deductive Databases, pages 2.1–2.9, Austin, Texas, 1990.
Z. Somogyi. A system of precise modes for logic programs. In Proceedings of the Fourth International Conference on Logic Programming, pages 769–787, Melbourne, Australia, 1987.
Z. Somogyi, D. Kemp, J. Harland, and K. Ramamohanarao. Subsumption-free bottom-up evaluation of logic programs with partially instantiated data structures. Technical Report 93/26, Department of Computer Science, University of Melbourne, Melbourne, Australia, 1993.
J. Thom and J. Zobel. NU-Prolog reference manual, version 1.0. Technical Report 86/10, Department of Computer Science, University of Melbourne, Melbourne, Australia, 1986.
J. Vaghani, K. Ramamohanarao, D. Kemp, Z. Somogyi, and P. Stuckey. Design overview of the Aditi deductive database system. In Proceedings of the Seventh International Conference on Data Engineering, pages 240–247, Kobe, Japan, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Somogyi, Z., Kemp, D., Harland, J., Ramamohanarao, K. (1994). Subsumption-free bottom-up evaluation of logic programs with partially instantiated data structures. In: Jarke, M., Bubenko, J., Jeffery, K. (eds) Advances in Database Technology — EDBT '94. EDBT 1994. Lecture Notes in Computer Science, vol 779. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57818-8_41
Download citation
DOI: https://doi.org/10.1007/3-540-57818-8_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57818-5
Online ISBN: 978-3-540-48342-7
eBook Packages: Springer Book Archive