Skip to main content
SpringerLink
Log in

On the power of query-independent compilation

  • Databases And Information Systems
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '91 (ICCI 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 497))

Included in the following conference series:

  • 117 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. H. Gallaire, J. Minker and J. Nicolas, Logic and Databases: A Deductive Approach, ACM Comput. Surv., 16(2), 1984, 153–185.

    Article  Google Scholar 

  6. J. Han and W. Lu, Asynchronous Chain Recursions, IEEE Trans. Knowledge and Data Engineering, 1(2), 1989, 185–195.

    Article  Google Scholar 

  7. J. Han, Multi-Way Counting Method, Information Systems, 14(3), 1989, 219–229.

    Article  Google Scholar 

  8. J. Han, Compiling General Linear Recursions by Variable Connection Graph Analysis, Computational Intelligence, 5(1), 1989, 12–31.

    Google Scholar 

  9. J. Han, Constraint-Based Reasoning in Deductive Databases, Proc. 7th Int. Conf. Data Engineering, Kobe, Japan, April 1991.

    Google Scholar 

  10. L. J. Henschen and S. Naqvi, On Compiling Queries in Recursive First-Order Databases, J. ACM, 31(1), 1984, 47–85.

    Article  Google Scholar 

  11. J. F. Naughton, One-Sided Recursions, Proc. 6th ACM Symp. Principles of Database Systems, San Diego, CA, March 1987, 340–348.

    Google Scholar 

  12. R. Ramakrishnan, Magic Templates: A Spellbinding Approach to Logic Programs, Proc. Int. Conf. Logic Programming, Seattle, WA, August 1988, 140–159.

    Google Scholar 

  13. J. D. Ullman, Implementation of Logical Query Languages for Databases, ACM Trans. Database Syst., 10(3), 1985, 289–321.

    Article  Google Scholar 

  14. J. D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. 2, Computer Science Press, Rockville, MD, 1989.

    Google Scholar 

  15. L. Vieille, Recursive Axioms in Deductive Databases: The Query/Subquery Approach, Proc. 1st Int. Conf. Expert Database Systems, Charleston, SC, April 1986, 179–193.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, B.C., Canada

    Jiawei Han

Authors
  1. Jiawei Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Frantisek Fiala Waldemar W. Koczkodaj

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation