Abstract
The magic sets method [Bancilhon et al 86, Been & Ramakrishnan 87] is one of the most popular methods of recursive query processing for deductive databases. The magic sets method and its variants may be regraded as computing filters for restricting bottom-up evaluation of rules and then applying these filters to various rules. There is a tradeoff between the simplicity of the filters and their effectiveness. The magic sets method sacrifices the simplicity of the filters for their effectiveness. [Sippu & S-Soininen 88] describes a method which always keeps the filter computation much simpler than the processing of the query at the expense of filters which can be much less tight than the magic predicates. [Sagiv 90] describes a method of envelopes which has the advantage that the size of an envelope is much smaller than the size of magic predicates. In this paper, we approach this tradeoff from a structural perspective. We show that under certain conditions, which depend on the structure of the rules, it is possible to use filters which are much less in size than magic predicates, while preserving the effectiveness of magic predicates. Thus, our filters are smaller than magic predicates, while the restriction imposed by them is the same as that imposed by the magic predicates.
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
Bancilhon, F., Maier, D., Sagiv, Y. and Ullman, J. D. “Magic sets and other strange ways to implement logic programs,” ACM Symp. PODS, 1986, pp. 1–15.
Beeri, C. and Ramakrishnan, R. “On the power of magic,” ACM Symp. PODS, 1987, pp. 269–283.
Berge, C. Graphs and Hypergraphs, North Holland, 1973.
Bry, F. “Query evaluation in recursive databases: top-down and bottom-up reconciled,” Proc. 1st Int. Conf. Deductive and Object-Oriented Databases, Japan, 1989, pp. 20–39.
Kerisit, J-M. “A relational approach to logic programming: the extended Alexander method,” Theoretical Computer Science, 69:1(1989), 55–68.
Kifer, M. and Lozinskii, B. L. “A framework for an efficient implementation of deductive databases,” Proc. Advanced Database Symp., Japan, 1986, pp. 109–116.
Ramakrishnan, R. “Magic templates: a spellbinding approach logic programs,” Proc. ICLP, 1988, pp. 140–159.
Sagiv, Y. “Is there anything better than magic?,” Proc. North Amer. Conf. Logic Programming, 1990, pp. 235–254.
Seki, H. “On the power of Alexander templates,” ACM Symp. PODS, 1989, pp. 150–159.
Sippu, S. and Soisalon-Soininen, E. “An optimization strategy for recursive queries in logic databases,” IEEE Conf. Data Engg., 1988, pp. 470–477.
Ullman, J. D. Principles of Database and Knowledge-Base Systems, vol. II, Computer Science Press, MD, 1989.
Vielle, L. “Recursive query processing: the power of logic,” Theoretical Computer Science, 69:1(1989), 1–53.
Yim, C-H. Toward an Efficient Query Prcessor for a Deductive Database System, M.Sc. Thesis, Dept. of Computer Science, Concordia University, Montreal, March 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Lakshmanan, V.S., Yim, C.H. (1992). Can Filters do Magic for Deductive Databases?. In: Wiggins, G.A., Mellish, C., Duncan, T. (eds) ALPUK 91. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3546-3_10
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3546-3_10
Publisher Name: Springer, London
Print ISBN: 978-3-540-19734-8
Online ISBN: 978-1-4471-3546-3
eBook Packages: Springer Book Archive