When Can We Answer Queries Using Result-Bounded Data Interfaces?

06/24/2017
by   Antoine Amarilli, et al.
0

We consider answering queries where the underlying data is available only over limited interfaces which provide lookup access to the tuples matching a given binding, but possibly restricting the number of output tuples returned. Interfaces imposing such "result bounds" are common in accessing data via the web. Given a query over a set of relations as well as some integrity constraints that relate the queried relations to the data sources, we examine the problem of deciding if the query is answerable over the interfaces; that is, whether there exists a plan that returns all answers to the query, assuming the source data satisfies the integrity constraints. The first component of our analysis of answerability is a reduction to a query containment problem with constraints. The second component is a set of "schema simplification" theorems capturing limitations on how interfaces with result bounds can be useful to obtain complete answers to queries. These results also help to show decidability for the containment problem that captures answerability, for many classes of constraints. The final component in our analysis of answerability is a "linearization" method, showing that query containment with certain guarded dependencies -- including those that emerge from answerability problems -- can be reduced to query containment for a well-behaved class of linear dependencies. Putting these components together, we get a detailed picture of how to check answerability over result-bounded services.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/03/2019

Reasoning about disclosure in data integration in the presence of source constraints

Data integration systems allow users to access data sitting in multiple ...
research
10/07/2020

Query Rewriting On Path Views Without Integrity Constraints

A view with a binding pattern is a parameterised query on a database. Su...
research
05/24/2021

Harmless but Useful: Beyond Separable Equality Constraints in Datalog+/-

Ontological query answering is the problem of answering queries in the p...
research
06/27/2023

A fine-grained framework for database repairs

We introduce a general abstract framework for database repairing that di...
research
12/17/2019

Querying Linked Data: An Experimental Evaluation of State-of-the-Art Interfaces

The adoption of Semantic Web technologies, and in particular the Open Da...
research
05/20/2021

Interactive Query Formulation using Spider Queries

Effective information disclosure in the context of databases with a larg...
research
12/21/2022

Tighter bounds for query answering with Guarded TGDs

We consider the complexity of the open-world query answering problem, wh...

Please sign up or login with your details

Forgot password? Click here to reset