Equivalent Rewritings on Path Views with Binding Patterns

03/16/2020
by   Julien Romero, et al.
0

A view with a binding pattern is a parameterized query on a database. Such views are used, e.g., to model Web services. To answer a query on such views, the views have to be orchestrated together in execution plans. We show how queries can be rewritten into equivalent execution plans, that are guaranteed to deliver the same results than the query on all databases. We provide a correct and complete algorithm to find these plans for path views and atomic queries. Finally, we show that our method can be used to answer queries on real-world Web services.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
03/12/2020

On monotonic determinacy and rewritability for recursive queries and views

A query Q is monotonically determined over a set of views if Q can be ex...
research
05/05/2022

Leveraging Application Data Constraints to Optimize Database-Backed Web Applications

Exploiting the relationships among data, such as primary and foreign key...
research
02/13/2019

SaGe: Web Preemption for Public SPARQL Query Services

To provide stable and responsive public SPARQL query services, data prov...
research
05/19/2021

Automatic View Selection in Graph Databases

Recently, several works have studied the problem of view selection in gr...
research
07/29/2019

Precomputing Datalog evaluation plans in large-scale scenarios

With the more and more growing demand for semantic Web services over lar...
research
06/01/2020

Balancing expressiveness and inexpressiveness in view design

We study the design of data publishing mechanisms that allow a collectio...

Please sign up or login with your details

Forgot password? Click here to reset