Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation

@inproceedings{Benedikt2016GeneratingPF,
  title={Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation},
  author={Michael Benedikt and Julien Leblay and Balder ten Cate and Efthymia Tsamoura},
  booktitle={Synthesis Lectures on Data Management},
  year={2016}
}
Abstract Query reformulation refers to a process of translating a source query—a request for information in some high-level logic-based language—into a target plan that abides by certain interface ... 
View via Publisher
link.springer.com
49 Citations
Highly Influential Citations
5
Background Citations
23
Methods Citations
11

49 Citations

Physical Data Independence: Query and Update Compilation System description: A Compiler for Database Queries and Updates Keywords: Automated Reasoning, Planning and Optimization

  • Computer Science
  • 2021
A compiler and optimizer that compiles relational queries and updates with respect to a given database schema to source code in C with minimal extra-logical annotations is presented.

PIE - Proving, Interpolating and Eliminating on the Basis of First-Order Logic

PIE is a Prolog-embedded environment for automated reasoning on the basis of first-order logic. It includes a versatile formula macro system and supports the creation of documents that intersperse…

Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order Logic

PIE is a Prolog-embedded environment for automated reasoning on the basis of first-order logic that supports a workflow based on documents that intersperse macro definitions, invocations of reasoners, and LaTeX-formatted natural language text.

Answering Queries Using Views, Second Edition

Abstract The topic of using views to answer queries has been popular for a few decades now, as it cuts across domains such as query optimization, information integration, data warehousing, website ...

Equivalent Rewritings on Path Views with Binding Patterns

It is shown how queries can be rewritten into equivalent execution plans, which are guaranteed to deliver the same results as the query on all databases, and how this method can be used to answer queries on real-world Web services.

First-Order Ontology Mediated Database Querying via Query Reformulation

This work considers first-order ontology systems playing the role of a conceptual model of a database represented as a classical finite relational store, either with an open world or a closed world reading.

1 Generating collection transformations from proofs

This work shows that one can synthesize transformations from proofs that a formula provides an implicit definition, where the proof is in an intuitionistic calculus that captures a natural style of reasoning about nested collections.

Projective Beth Definability and Craig Interpolation for Relational Query Optimization (Material to Accompany Invited Talk)

This talk elaborates on how logic-based approaches can be used to capture both the high-level conceptual views of information and the low-level physical layout of data and presents the design of a relational query optimizer based on Craig interpolation that allows users to compile both queries and updates to low- level code that operates directly over a physical encoding of the data.

Generating collection transformations from proofs

This work shows that one can synthesize transformations from proofs that a formula provides an implicit definition, where the proof is in an intuitionistic calculus that captures a natural style of reasoning about nested collections.

Generating collection queries from proofs

This work shows that NRC has a strong connection with first-order logic: it contains exactly the transformations that are implicitly definable by formulas $\varphi$ in first- order logic with quantification suited for nested collections.

References

SHOWING 1-10 OF 47 REFERENCES

Generating low-cost plans from proofs

This work starts by overviewing a correspondence between proofs and restricted-interface plans in the context of arbitrary first-order constraints, based on interpolation, and provides direct plan-generation algorithms for schemas based on tuple-generating dependencies.

Exact Query Reformulation over Databases with First-order and Description Logics Ontologies

A non-trivial application of the framework with ontologies in the very expressive ALCHOIQ description logic is presented, by providing effective means to compute safe-range first-order exact reformulations of queries.

Answering queries using templates with binding patterns (extended abstract)

This work shows how to decide with a nondeterministic polynomial-time algorithm whether the given query can be answered and extends the results to allow arithmetic comparisons in the givenquery and in the templates.

Towards a Logical Reconstruction of Relational Database Theory

  • R. Reiter
  • Computer Science
    On Conceptual Modelling
  • 1982
Insofar as database theory can be said to owe a debt to logic, the currency on loan is model theoretic in the sense that a database can be viewed as a particular kind of first order interpretation,…

Optimal implementation of conjunctive queries in relational data bases

It is shown that while answering conjunctive queries is NP complete (general queries are PSPACE complete), one can find an implementation that is within a constant of optimal.

Answering queries with useful bindings

This article proposes a query-planning framework to answer queries in the presence of limited access patterns, and develops algorithms to solve optimization problems in this framework, and thus construct an efficient program to answer a query.

PDQ: Proof-driven Query Answering over Web-based Data

PDQ (Proof-Driven Query Answering), a system for determining a query plan in the presence of web-based sources, is introduced, taking the novel approach of generating query plans from proofs that a query is answerable.

Querying with Access Patterns and Integrity Constraints

This paper presents a system in which classical cost-based join optimization is extended to support both access-restrictions and constraints, and explores a space of proofs that witness the answering of the query, where each proof has a direct correspondence with a query plan.

Clio grows up: from research prototype to industrial tool

The architecture and algorithms behind Clio are revisited, some implementation issues, optimizations needed for scalability, and general lessons learned in the road towards creating an industrial-strength tool are discussed.

Answering queries using views (extended abstract)

It is shown that all the possible rewritings can be obtained by considering cent ainment mappings from the views to the query, and that the problems considered are NP-complete when both the query and the views are conjunctive and don’t involve builtin comparison predicates.