Multiple SIP strategies and bottom-up adorning in logic query optimization

  • Seppo Sippu
  • Eljas Soisalon-Soininen
Optimization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 470)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. [4.
    C. Beeri, and R. Ramakrishnan, On the power of magic. In: Proc. 6th ACM Symp. on Principles of Database Systems, 1987, pp 269–283.Google Scholar
  5. [5.
    R. Ramakrishnan, Magic templates: a spellbinding approach to logic programs. In: Proc. 5th Internat. Symp. on Logic Programming, 1988, pp 140–159.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    J. D. Ullman, Implementation of logical query languages for databases. ACM Trans. Database Syst. 10 (1985), 289–321.Google Scholar
  8. 8.
    J. D. Ullman, Principles of Database and Knowledge-Base Systems, vol. I, Computer Science Press, 1988.Google Scholar
  9. 9.
    J. D. Ullman, Principles of Database and Knowledge-Base Systems, vol. II: The New Technologies, Computer Science Press, 1989.Google Scholar
  10. 10.
    J. D. Ullman, Bottom-up beats top-down for datalog. In: Proc. 8th ACM Symp. on Principles of Database Systems, 1989, pp 140–149.Google Scholar
  11. 11.
    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.Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Seppo Sippu
    • 1
  • Eljas Soisalon-Soininen
    • 2
  1. 1.Department of Computer ScienceUniversity of JyväskyläFinland
  2. 2.Department of Computer ScienceUniversity of HelsinkiHelsinkiFinland

Personalised recommendations