Download PDFOpen PDF in browser

An Interpolation-based Compiler and Optimizer for Relational Queries (System design Report)

10 pagesPublished: June 4, 2017

Abstract

We outline the implementation of a query compiler for relational queries that generates query plans with respect to a database schema, that is, a set of arbitrary first-order constraints, and a distinguished subset of predicate symbols from the underlying signature that correspond to access paths. The compiler is based on a variant of the Craig interpolation theorem, with reasoning realized via a modified analytic tableau proof procedure. This procedure decouples the generation of candidate plans that are interpolants from the tableau proof procedure, and applies A*-based search with respect to an external cost model to arbitrate among the alternative candidate plans. The tableau procedure itself is implemented as a virtual machine that operates on a compiled and optimized byte-code that faithfully implements reasoning with respect to the database schema constraints and a user query.

Keyphrases: interpolation, query optimization, tableau proofs

In: Thomas Eiter, David Sands, Geoff Sutcliffe and Andrei Voronkov (editors). IWIL Workshop and LPAR Short Presentations, vol 1, pages 1--10

Links:
BibTeX entry
@inproceedings{LPAR-21S:An_Interpolation_based_Compiler_and,
  author    = {David Toman and Grant Weddell},
  title     = {An Interpolation-based Compiler and Optimizer for Relational Queries (System design Report)},
  booktitle = {IWIL Workshop and LPAR Short Presentations},
  editor    = {Thomas Eiter and David Sands and Geoff Sutcliffe and Andrei Voronkov},
  series    = {Kalpa Publications in Computing},
  volume    = {1},
  pages     = {1--10},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2515-1762},
  url       = {https://easychair.org/publications/paper/5t5r},
  doi       = {10.29007/53fk}}
Download PDFOpen PDF in browser