Implementation Alternatives for Bottom-Up Evaluation

Author Stefan Brass

Thumbnail PDF


  • Filesize: 263 kB
  • 10 pages

Document Identifiers

Author Details

Stefan Brass

Cite AsGet BibTex

Stefan Brass. Implementation Alternatives for Bottom-Up Evaluation. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 44-53, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDmagic that ensures that only facts relevant for the query can be derived. Then bottom-up evaluation simply performs the iteration of the standard TP -operator to compute the minimal model. However, there are different ways to implement bottom-up evaluation efficiently. Since this is most critical for the performance of a deductive database system, and since performance is critical for the acceptance of deductive database technology, this question deserves a thorough analysis. In this paper we start this work by discussing several different implementation alternatives. Especially, we propose a new implementation of bottom-up evaluation called "Push-Method".
  • Deductive databases
  • bottom-up evaluation
  • implementation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail