Abstract
Preprocessing methods called “readorning” and “bottom-up adorning” are introduced as means of enlarging the application domain of magic sets and related query optimization strategies for logic databases. Readorning tries to make possible the simultaneous use of multiple sideways information passing (sip) strategies defined for a rule, thus yielding an optimization effect that may not be achieved by any particular choice of sip strategies. Bottom-up adorning is used to make magic sets applicable to cases in which potential optimizations can be derived from bindings coming upwards from rule bodies to rule heads in bottom-up evaluation. These include the cases in which we know that some base relation is small or that the domain of an attribute of some relation is small. Bottom-up adorning followed by readorning will propagate these bindings to other parts of the datalog program.
The work was supported by the Academy of Finland.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
F. Bancilhon, Naive evaluation of recursively defined relations. In: On Knowledge Base Management Systems — Integrating Artificial Intelligence and Database Technologies, (Brodie and Mylopoulos, eds), Springer-Verlag, 1986, pp 165–178.
F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman, Magic sets and other strange ways to implement logic programs. In: Proc. 5th ACM Symp. on Principles of Database Systems, 1986, pp 1–15.
F. Bancilhon, and R. Ramakrishnan, An amateur's introduction to recursive query processing strategies. In: Proc. ACM SIGMOD'86, Internat. Conf. on Management of Data, 1986, pp 16–52.
C. Beeri, and R. Ramakrishnan, On the power of magic. In: Proc. 6th ACM Symp. on Principles of Database Systems, 1987, pp 269–283.
R. Ramakrishnan, Magic templates: a spellbinding approach to logic programs. In: Proc. 5th Internat. Symp. on Logic Programming, 1988, pp 140–159.
S. Sippu and E. Soisalon-Soininen, An optimization strategy for recursive queries in logic databases. In: Proc. 4th Internat. IEEE Conf. on Data Engineering, 1988, pp 470–477.
J. D. Ullman, Implementation of logical query languages for databases. ACM Trans. Database Syst. 10 (1985), 289–321.
J. D. Ullman, Principles of Database and Knowledge-Base Systems, vol. I, Computer Science Press, 1988.
J. D. Ullman, Principles of Database and Knowledge-Base Systems, vol. II: The New Technologies, Computer Science Press, 1989.
J. D. Ullman, Bottom-up beats top-down for datalog. In: Proc. 8th ACM Symp. on Principles of Database Systems, 1989, pp 140–149.
A. Van Gelder, A message passing framework for logical query evaluation. In: Proc. ACM SIGMOD'86, Internat. Conf. on Management of Data, 1986, pp 155–165.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sippu, S., Soisalon-Soininen, E. (1990). Multiple SIP strategies and bottom-up adorning in logic query optimization. In: Abiteboul, S., Kanellakis, P.C. (eds) ICDT '90. ICDT 1990. Lecture Notes in Computer Science, vol 470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53507-1_97
Download citation
DOI: https://doi.org/10.1007/3-540-53507-1_97
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53507-2
Online ISBN: 978-3-540-46682-6
eBook Packages: Springer Book Archive