Abstract
Recursive query processing techniques can be classified into three categories: interpretation, query-dependent compilation and query-independent compilation. Query-dependent compilation compiles IDB programs based on possible query instantiations into query-specific EDB programs, while query-independent compilation compiles IDB programs into query-independent and easily analyzable EDB expressions. Previous studies show that linear recursions can be query-independently compiled into highly regular forms. This study analyzes the power of query-independent compilation and shows that (i) query-independent compilation captures more binding information than other methods for irregular linear recursions; (ii) the compilation provides succinct information for the selection of efficient query processing methods; and (iii) it facilitates the constraint-based processing of complex queries. Finally, query-independent compilation can be applied to more complex recursions as well.
The work was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant A-3723 and a research grant of Centre for Systems Science of Simon Fraser University.
Preview
Unable to display preview. Download preview PDF.
References
F. Bancilhon, D. Maier, Y. Sagiv and J. D. Ullman, Magic Sets and Other Strange Ways to Implement Logic Programs, Proc. 5th ACM Symp. Principles of Database Systems, Cambridge, MA, March 1986, 1–15.
F. Bancilhon and R. Ramakrishnan, An Amateur's Introduction to Recursive Query Processing Strategies, Proc. 1986 ACM-SIGMOD Conf. Management of Data, Washington, DC, May 1986, 16–52.
C. Berri and R. Ramakrishnan, On the Power of Magic, Proc. 6th ACM Symp. Principles of Database Systems, San Diego, CA, March 1987, 269–283.
C. Beeri, P. Kanellakis, F. Bancilhon and R. Ramakrishnan, Bounds on the Propagation of Selection into Logic Programs, Proc. 6th ACM Symp. Principles of Database Systems, San Diego, CA, March 1987, 214–226.
H. Gallaire, J. Minker and J. Nicolas, Logic and Databases: A Deductive Approach, ACM Comput. Surv., 16(2), 1984, 153–185.
J. Han and W. Lu, Asynchronous Chain Recursions, IEEE Trans. Knowledge and Data Engineering, 1(2), 1989, 185–195.
J. Han, Multi-Way Counting Method, Information Systems, 14(3), 1989, 219–229.
J. Han, Compiling General Linear Recursions by Variable Connection Graph Analysis, Computational Intelligence, 5(1), 1989, 12–31.
J. Han, Constraint-Based Reasoning in Deductive Databases, Proc. 7th Int. Conf. Data Engineering, Kobe, Japan, April 1991.
L. J. Henschen and S. Naqvi, On Compiling Queries in Recursive First-Order Databases, J. ACM, 31(1), 1984, 47–85.
J. F. Naughton, One-Sided Recursions, Proc. 6th ACM Symp. Principles of Database Systems, San Diego, CA, March 1987, 340–348.
R. Ramakrishnan, Magic Templates: A Spellbinding Approach to Logic Programs, Proc. Int. Conf. Logic Programming, Seattle, WA, August 1988, 140–159.
J. D. Ullman, Implementation of Logical Query Languages for Databases, ACM Trans. Database Syst., 10(3), 1985, 289–321.
J. D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. 2, Computer Science Press, Rockville, MD, 1989.
L. Vieille, Recursive Axioms in Deductive Databases: The Query/Subquery Approach, Proc. 1st Int. Conf. Expert Database Systems, Charleston, SC, April 1986, 179–193.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, J. (1991). On the power of query-independent compilation. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_168
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_168
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive