Abstract
This paper describes the optimization approach taken to ensure the safe and efficient execution of applications written in LDL, which is a declarative language based on Horn Clause Logic and intended for data intensive and knowledge based applications. In order to generalize the strategy successfully used in relational database systems we first characterize the optimization problem in terms of its execution space, cost functions and search algorithm. Then we extend this framework to deal with rules, complex terms, recursion and various problems resulting from the richer expressive power of Logic. Among these is the termination problem (safety), whereby an unsafe execution is treated as an extreme case of poor execution.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ait-Kaci, H. and R. Nasr, “Residuation: a Paradigm for Integrating Logic and Functional Programming,” submitted for publication.
Aho, A. and J. Ullman, Universality of Data Retrieval Languages, Proc. POPL Conf., San Antonio, TX, 1979.
Bancilhon, F., D, Maier, Y. Sagiv and Ullman, Magic Sets and other Strange Ways to Implements Logic Programs, Proc. 5-th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems, pp. 1–16, 1986.
Bancilhon, F., and R. Ramakrishan, An Amateur's Introduction to Recursive Query Processing Strategies, Proc. 1986 ACM-SIGMOD Intl. Conf. on Mgt. of Data, pp. 16–52, 1986.
Beeri, C., S. Naqvi, R. Ramakrishnan, O. Shmueli, S. Tsur, Sets and Negation in a Logic Database Language, Proc. 6-th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems, 1987.
Colmemauer, A. et al., Prolog II: Reference Manual and Theoretical Model, Groupe d'Intelligence artificielle, Faculte de Sciences de Lumin, 1982.
Grant, J. and Minker J., On Optimizing the Evaluation of a Set of Expressions, Int. Journal of Computer and Information Science, 11, 3 (1982), 179–189.
Ioannidis, Y. E, Wong, E, Query Optimization by Simulated Annealing, Proc. 1987 ACM-SIGMOD Intl. Conf. on Mgt. oof Data, San Francisco, 1987.
Kowalski, R.A., “Algorithm = Logic + Control”, CACM, 22, 7, pp. 424–436, (1979).
Krishnamurthy, R., Boral, H., Zaniolo, C. Optimization of Nonrecursive Queries, Proc. of 12th VLDB, Kyoto, Japan, 1986.
Krishnamurthy, R., R. Ramakrishnan. O. Shmueli, “A Framework for Testing Safety and Effective Computability”, MCC Report 1987 and also submitted for external publication.
Kellog, C., and Travis, L. Reasoning with data in a deductively augmented database system, in Advances in Database Theory: Vol 1, H. Gallaire, J. Minker, and J. Nicholas eds., Plenum Press, New York, 1981, pp 261–298.
Lloyd, J. W., Foundations of Logic Programming, Springer-Verlag, 1984.
Maier, D., The Theory of Relational Databases, (pp. 553–542), Comp. Science Press, 1984.
K. Morris, J. D. Ullman and A. Van Gelder, Design Overview of the Nail! System, Proc. Third Int. Symposium on Logic Programming, pp. 127–139, 1986.
Naish, L., Negation and Control in Prolog, Ph. D. Thesis, Dept. of CS, Univ. of Melbourne, Austr., 1985.
Naqvi Shamim and R. Krishnamurthy, Semantics of Updates in Logic Programming, Workshop on Database and Programming Languages, Roscoff, France 1987.
Pereira Luis Moniz, Logic Control with Logic, UNL Report 2/82 (1982).
Ramakrishnan, R, C. Beeri, R. Krishnamurthy, Optimizing Existential Queries, MCC Technical Report, 1987, (also submitted for external publication).
Sellinger, P.G. et. al. Access Path Selection in a Relational Database Management System., Proc. 1979 ACM-SIGMOD Intl. Conf. on Mgt. of Data, pp. 23–34, 1979.
Smith, D. E. and M. R. Genesereth, Ordering Conjunctive Queries, Artificial Intelligence 26, pp. 171–185, 1985.
Sacca', D. and C. Zaniolo, The Generalized Counting Method for Recursive Logic Queries, Proc. ICDT '86 —Int. Conf. on Database Theory, Rome, Italy 1986.
Tsur, S. and C. Zaniolo, LDL: A Logic-Based Data Language, Proc. of 12th VLDB, Kyoto, Japan, 1986.
Ullman, J. D., Implementation of logical query languages for databases, TODS, 10, 3, (1985), 289–321.
Ullman, J.D. and A. Van Gelder, Testing Applicability of Top-Down Capture Rules, Stanford Univ. Report STAN-CS-85-146, 1985.
Villarreal, E., “Evaluation of an O(N**2) Method for Query Optimization”, MS Thesis, Dept. of Computer Science, Univ. of Texas at Austin, Austin, TX.
Zaniolo, C. The representation and deductive retrieval of complex objects, Proc. of 11th VLDB, pp. 458–469, 1985.
Zaniolo, C., Safety and Compilation of Non-Recursive Horn Clauses, Proc. First Int. Conf. on Expert Database Systems, Charleston, S.C., 1986.
Zaniolo C. and D. Sacca', “Rule Rewriting Methods for Efficient Implementations of Horn Logic,” MCC Technical Report 1987, submitted for publication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishnamurthy, R., Zaniolo, C. (1988). Optimization in a logic based language for knowledge and data intensive applications. In: Schmidt, J.W., Ceri, S., Missikoff, M. (eds) Advances in Database Technology—EDBT '88. EDBT 1988. Lecture Notes in Computer Science, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19074-0_45
Download citation
DOI: https://doi.org/10.1007/3-540-19074-0_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19074-5
Online ISBN: 978-3-540-39095-4
eBook Packages: Springer Book Archive