A Deductive Database System with Applications to Route Planning

  • Malcolm C. Taylor
  • Bogdan D. Czejdo
Conference paper


The issue of deductive query optimization has received widespread attention, yet the problem of dealing with functions defined on complex data structures remains unresolved. In this paper we present an approach which allows for abstract data types and arbitrary user-defined functions within the framework of an extended relational model. Functions may appear in both rules and queries, and the optimization process uses a combination of term rewriting and distribution of selections. Our approach provides a clean integration of functions into both the language and the optimization algorithm, and yields efficient strategies for a wide range of queries. The technique is demonstrated on a route planning application.


Relational Algebra Left Branch Query Optimization Route Planning Query Graph 
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.


  1. [1]
    R. Agrawal, P. Devanbu, “Moving selections into linear least fixpoint queries”, IEEE International Conference on Data Engineering, 1988.Google Scholar
  2. [2]
    A. Aho, J. Ullman, “Universality of data retrieval languages”, conference on POPL, 1979.Google Scholar
  3. [3]
    F. Bancilhon et al, “Magic sets and other strange ways to implement logic programs”, ACM International Symposium on PODS, 1986.Google Scholar
  4. [4]
    F. Bancilhon, R. Ramakrishnan, “An amateur’s introduction to recursive query processing strategies”, ACM SIGMOD Conference, 1986.Google Scholar
  5. [5]
    C. Beeri, R. Ramakrishnan, “On the power of magic”, ACM international symposium on PODS, 1987.Google Scholar
  6. [6]
    J. Bocca, “On the evaluation strategy of EDUCE”, International conference on management of data, 1986.Google Scholar
  7. [7]
    S. Ceri, L. Tanca, “Optimization of algebraic equations for evaluating D1atalog queries”, International Conference on Very Large Databases, 1987.Google Scholar
  8. [8]
    D. Chimenti et al, “The LDL system prototype”, IEEE-TKDE 2: 1, 1990.Google Scholar
  9. [9]
    H. Ehrig, B. Mahr, “Fundamentals of algebraic specification 1: equations and initial semantics”, Springer-Verlag, 1985.Google Scholar
  10. [10]
    R. Elmasri, S. Navathe, “Fundamentals of database systems”, Benjamin-Cummings, 1989.Google Scholar
  11. [11]
    J. Goguen, J. Meseguer, “Rapid protoyping in the OBJ executable specification language”, Technical Report CSL-137, SRI International, 1982.Google Scholar
  12. [12]
    M. Kifer, E. Lozinskii,“Filtering data flow in deductive databases”, ICDT, 1986.Google Scholar
  13. [13]
    N. Miyazaki, “Selection propagation in deductive databases: from pushing selections to magic sets”, Data and Knowledge Engineering 5, 1990.Google Scholar
  14. [14]
    M. Stonebraker, L. Rowe, “The design of POSTGRES”, International Conference on Management of Data, 1986.Google Scholar
  15. [15]
    M. Taylor, “Logical optimisation of distributed knowledge base queries”, Computer Journal 33: 1, 1990.CrossRefGoogle Scholar
  16. [16]
    L. Vieille, “Recursive axioms in deductive databases: the querysubquery approach”, International conference on expert database systems, 1986.Google Scholar

Copyright information

© Springer-Verlag Wien 1991

Authors and Affiliations

  • Malcolm C. Taylor
    • 1
  • Bogdan D. Czejdo
    • 2
  1. 1.Department of Computer ScienceUniversity of HoustonHoustonUSA
  2. 2.Department of Mathematical SciencesLoyola UniversityNew OrleansUSA

Personalised recommendations