Query optimization for Deductive Databases

  • Zhou Aoying 
  • Shi Baile 
Regular Papers


A systematic, efficient compilation method for query evaluation of Deductive Databases (DeDB) is proposed in this paper. In order to eliminate redundancy and to minimize the potentially relevant facts, which are two key issues to the efficiency of a DeDB, the compilation process is decomposed into two phases. The first is the pre-compilation phase, which is responsible for the minimization of the potentially relevant facts. The second, which we refer to as the general compilation phase, is responsible for the elimination of redundancy. The rule/goal graph devised by J. D. Ullman is appropriately extended and used as a uniform formalism. Two general algorithms corresponding to the two phases respectively are described intuitively and formally.


Deductive database query evaluation query optimization 


  1. [1]
    Gallaire H, Minker J, Nicolas J M. Logic and databases: A deductive approach.Computing Surveys, 1984, 16(2): 153–185.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Xu Jiepan. Deductive databases and the state of the art.Computer Science, 1987, 14(1): 52–55. (in Chinese)Google Scholar
  3. [3]
    Gallaire H, Minker J (eds.). Logic and Database. Plenum Press, New York, 1978.Google Scholar
  4. [4]
    Ullman J D. The past and future of database theory. InProc. of 6th PODS., San Diego, California, March 23–25, 1987, pp. 1–10.Google Scholar
  5. [5]
    Kowalski R. Logic for problem solving. North Holland, Amsterdam, 1979.zbMATHGoogle Scholar
  6. [6]
    Lloyd J W. An introduction to deductive database systems.The Australian Computer Journal, 1983, 15(2): 52–57.MathSciNetGoogle Scholar
  7. [7]
    Frost R. Introduction to knowledge base systems. Collins, London, 1986.Google Scholar
  8. [8]
    Date C J. An introduction to database systems the 4th edition, Addison-Wesley Publishing Company, Reading, Massachusetts, 1987.Google Scholar
  9. [9]
    Ullman J D. Principle of database and knowledge-base systems. Vols. 1 & 2, Computer Science Press, Rockville, Maryland, 1988 & 1990.Google Scholar
  10. [10]
    Bancilhon F, Ramakrishnan R. An amateur's introduction to recursive query evaluation processing strategies. InProc. of ACM SIGMOD'86, Washington D.C., May 28–30, 1986, pp. 16–52.Google Scholar
  11. [11]
    Bancilhon F. Naive evaluation of recursively defined relations. InOn Knowledge Base Management Systems, Brodie M L, Mylopolos J (eds.), Springer-Verlag, New York, 1985, pp. 165–178.Google Scholar
  12. [12]
    Bancilhon F, Maier D, Sagiv Y, Ullman J D. Magic-set and other strange ways to implement logic programs. InProc. of 5th PODS., Washington D.C., May 28–30, 1986, pp. 1–15.Google Scholar
  13. [13]
    Rohmer J, Lescoeur R, Kerisit J M. The Alexander method—A technique for the processing of recursive axioms in deductive database.New Generation Computing, 1986, 4(1): 273–285.zbMATHCrossRefGoogle Scholar
  14. [14]
    Ullman J D. Implementation of logical query language for databases.ACM TODS, 1985, 10(3): 289–321.zbMATHCrossRefGoogle Scholar
  15. [15]
    Zhou Aoying. Information passing strategy of query evaluation for deductive databases. InProc. of Intl. Symposium for Young Computer Scientists, August 21–23, 1989, pp. 230–235.Google Scholar
  16. [16]
    Clocksin W F, Mellish C S. Programming in Prolog. the 3rd edition, Springer-Verlag, New York, 1987.zbMATHGoogle Scholar
  17. [17]
    Chang C L. On evaluation of queries containing derived relations in a data base. InAdvances in Database Theory, (I), Gallaire H, Minker J, Nicolas J M (eds.), Plenum Press, New York, 1981, pp. 235–260.Google Scholar
  18. [18]
    Minker J, Nicolas J M. On recursive axioms in deductive databases.Information Systems, 1983, 8(1): 1–13.zbMATHCrossRefGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1995

Authors and Affiliations

  • Zhou Aoying 
    • 1
  • Shi Baile 
    • 1
  1. 1.Department of Computer ScienceFudan UniversityShanghai

Personalised recommendations