A data structure for subsumption-based tabling in top-down resolution engines for data-intensive logic applications

  • Jacques Calmet
  • Peter Kullmann
Communications 6B Knowledge Representation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1609)


Using tables in top-down resolution engines is an effective way of optimization by avoiding recomputation of formerly derived facts. This effect can be even more exploited if, instead of considering only identical subgoals, facts from subsuming sugoals are reused. This is particularly of interest if recalculation is expensive, e.g. due to data transmission cost or the mere volume of data to be processed.

We present a data structure for subsumption-based tabling in subgoal-oriented resolution. Our data structure is based on hB-Trees, a multi-attribute indexing structure which emerged from research on database management systems. Hence, our data structure inherits desirable properties such as its use as efficient indexing structure for secondary storage.


Logic for Artificial Intelligence Intelligent Information Retrieval Subsumption-based Tabling Information Integration 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bay97]
    R. Bayer. The Universal B-Tree for Multidimensional Indexing. In Proceedings of the WWAC Conference, pages B-3-2-1-B-3-2-12, 1997.Google Scholar
  2. [BKK96]
    S. Berchthold, D. A. Keim, and H.-P. Kriegel. The X-Tree: An Index Structure for High-dimensional Data. In Proceedings of the International Conference on Very Large Data Bases (VLDB), pages 28–39, 1996.Google Scholar
  3. [CJKS97]
    J. Calmet, S. Jekutsch, P. Kullmann, and J. Schü. KOMET—a System for the Integration of Heterogeneous Information Sources. In 10th International Symposium on Methodologies for Intelligent Systems (ISMIS), 1997.Google Scholar
  4. [CW93]
    W. Chen and D. S. Warren. Query Evaluation Under the Well-founded Semantics. In ACM Symposium on Principles of Database Systems. ACM Press, 1993.Google Scholar
  5. [ELS95]
    G. Evangelidis, D. Lomet, and B. Salzberg. A Multi-attribute Index Supporting Concurrency, Recovery and Node Consolidation. In Proceedings of the International Conference on Very Large Data Bases (VLDB), 1995.Google Scholar
  6. [KS92]
    M. Kifer and V. S. Subrahmanian. Theory of Generalized Annotated Logic Programming. Journal of Logic Programming, 12(1):335–367, 1992.MathSciNetCrossRefGoogle Scholar
  7. [Lom92]
    D. Lomet. A Review of Recent Work on Multi-attribute Access Methods. SIGMOD Record, 20(3), September 1992.Google Scholar
  8. [LS90]
    D. Lomet and B. Salzberg. The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance. ACM Transactions on Database Systems, 15(4), December 1990.Google Scholar
  9. [RRR96]
    P. Rao, C. R. Ramakrishnan, and I. V. Ramakrishnan. A Thread in Time Saves Tabling Time. In Proceedings of the Joint International Conference and Symposium on Logic Programming, 1996.Google Scholar
  10. [SRF87]
    T. Sellis, N. Roussopoulus, and C. Faloutsus. The R+-Tree: A Dynamic Index for Multi-dimensional Objects. In Proceedings of the International Conference on Very Large Data Bases (VLDB), 1987.Google Scholar
  11. [TS86]
    H. Tamaki and T. Sato. OLD Resolution with Tabulation. In International Conference on Logic Programming, pages 84–98, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Jacques Calmet
    • 1
  • Peter Kullmann
    • 1
  1. 1.Institut für Algorithmen und Kognitive Systeme (IAKS) Fakultät für InformatikUniversität KarlsruheKarlsruheGermany

Personalised recommendations