Filtering data flow in deductive databases

  • Michael Kifer
  • Eliezer L. Lozinskii
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 243)


We investigate the question of how query optimization strategies devised for relational databases can be used for deductive databases. In particular, we show how the well known method of moving selections and projections down the parse trees of relational algebra expressions can be generalized to the case of deductive databases. The optimization is achieved by means of filtering data flow in the system.


Goal Node Output Port Input Port Transitive Closure Relational Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  1. [AhU79]
    A. V. Aho and J. D. Ullman, “Universality of Data Retrieval Languages”, Proc. Sixth ACM Symp. on Prin. of Programming Languages, 1979, 110–120.Google Scholar
  2. [BaR86]
    F. Bancilhon and R. Ramakrishnan, “An Amateur's Introduction to Recursive Query Processing Strategies”, ACM Proc. of the ACM-SIGMOD Intl. Conf. on Management of Data, 1986.Google Scholar
  3. [BMS86]
    F. Bancilhon, D. Maier, Y. Sagiv and J. D. Ullman, “Magic Sets and Other Strange Ways to Implement Logic Programs”, Proc. of the ACM SIGACT-SIGMOD Symp. on Prin. of Database Systems, Cambridge, MA, March, 1986.Google Scholar
  4. [ChH82]
    A. K. Chandra and D. Harel, “Horn Clauses and the Fixed Point Hierarchy”, Proc. of the ACM SIGACT-SIGMOD Symp. on Prin. of Database Systems, 1982, 158–163.Google Scholar
  5. [Cha81]
    C. Chang, “On Evaluation of Queries Containing Derived Relations in a Relational Database”, in Advances in Databases, vol. 1, H. Gallaire, J. Minker and J. M. Nicolas, (eds.), Plenum Press, 1981, 235–260.Google Scholar
  6. [DeA86]
    P. Devanbu and R. Agrawal, “Moving Selections into Fixpoint Queries”, unpablished manuscript, 1986.Google Scholar
  7. [GMN84]
    H. Gallaire, J. Minker and J. Nicolas, “Logic and Databases: A Deductive Approach”, Computing Surveys, 16, 2 (June 1984), 153–185.Google Scholar
  8. [HeN84]
    L. J. Henschen and S. A. Naqvi, “Compiling Queries in Relational First-Order Databases”, J. ACM, 31, 1 (1984), 47–85.Google Scholar
  9. [KiL85]
    M. Kifer and E. L. Lozinskii, “Query Optimization in Deductive Databases”, Tech. Rep.# 85/16, Dept. of Computer Science, SUNY at Stony Brook, June 1985.Google Scholar
  10. [KiL86a]
    M. Kifer and E. L. Lozinskii, “On Compile-Time Query Optimization in Deductive Databases”, submitted, 1986.Google Scholar
  11. [KiL86b]
    M. Kifer and E. L. Lozinskii, “A Framework for an Efficient Implementation of Deductive Database Systems”, Proceedings of the 6-th Advanced Database Symposium, Tokyo, Japan, Aug. 1986.Google Scholar
  12. [KiL86c]
    M. Kifer and E. L. Lozinskii, “Can We Implement Logic as a Database System?”, Tech. Rep.# 86/16, Dept. of Comp. Sci., SUNY @ Stony Brook, March 1986.Google Scholar
  13. [Loz85a]
    E. L. Lozinskii, “A Remark on Distributed Termination”, Proc. of the 5-th IEEE Intern. Conf. on Distributed Computing, Denver, Colorado, May, 1985.Google Scholar
  14. [Loz85b]
    E. L. Lozinskii, “Evaluating Queries in Deductive Databases by Generating”, Proc. of IJCAI, 1985, 173–177.Google Scholar
  15. [Loz86]
    E. L. Lozinskii, “A Problem-Oriented Inferential Database System”, ACM Trans. Database Systems, 1986. To appear.Google Scholar
  16. [McS81]
    D. P. McKay and S. C. Shapiro, “Using Active Connection Graphs for Reasoning with Recursive Rules”, IJCAI, 1981, 368–374.Google Scholar
  17. [RoH80]
    D. J. Rosenkrantz and H. B. Hunt, “Processing Conjunctive Predicates and Queries”, Proc. of the ACM Intl. Conf. on Very Large Data Bases, 1980, 64–72.Google Scholar
  18. [SaZ86a]
    D. Sacca and C. Zaniolo, “On the Implementation of the Simple Class of Logic Queries for Databases”, Proc. of the ACM SIGACT-SIGMOD Symp. on Prin. of Database Systems, 1986, 16–23.Google Scholar
  19. [SaZ86b]
    D. Sacca and C. Zaniolo, “Implementing Recursive Logic Queries with Function Symbols”, Tech. Rep.# DB-065-86, MCC, Austin, Tx, Feb 1986.Google Scholar
  20. [ShM80]
    S. C. Shapiro and D. P. McKay, “Inference with Recursive Rules”, Proc. First Annual National Conf. On Artificial Intelligence, Stanford, 1980, 151–153.Google Scholar
  21. [Ull82]
    J. D. Ullman, Principles of Database Systems, Computer Science Press, Rockville, MD, 1982.Google Scholar
  22. [vaK76]
    M. H. vanEmden and R. A. Kowalski, “The Semantics of Predicate Logic as a Programming Language”, J. ACM, 23, 4 (Oct. 1976), 733–742.Google Scholar
  23. [WoY76]
    E. Wong and K. Youssefi, “Decomposition — A Strategy for Query Processing”, ACM ACM Trans. Database Systems, 1, 3 (Sept. 1976), 223–241.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Michael Kifer
    • 1
  • Eliezer L. Lozinskii
    • 2
  1. 1.Department of Computer ScienceSUNY at Stony BrookStony BrookUSA
  2. 2.Department of Computer ScienceThe Hebrew UniversityJerusalemIsrael

Personalised recommendations