Asymptotic Determinacy of Path Queries using Union-of-Paths Views

Nadime Francis 1
1 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
Abstract : We consider the view determinacy problem over graph databases for queries defined as (possibly infinite) unions of path queries. These queries select pairs of nodes in a graph that are connected through a path whose length falls in a given set. A view specification is a set of such queries. We say that a view specification V determines a query Q if, for all databases D, the answers to V on D contain enough information to answer Q. Our main result states that, given a view V, there exists an explicit bound that depends on V such that we can decide the determinacy problem for all queries that ask for a path longer than this bound, and provide first-order rewritings for the queries that are determined. We call this notion asymptotic determinacy. As a corollary, we can also compute the set of almost all path queries that are determined by V.
Document type :
Conference papers
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01150780
Contributor : Nadime Francis <>
Submitted on : Monday, May 11, 2015 - 7:19:36 PM
Last modification on : Thursday, February 7, 2019 - 5:29:22 PM
Long-term archiving on : Wednesday, April 19, 2017 - 9:55:39 PM

File

3.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Nadime Francis. Asymptotic Determinacy of Path Queries using Union-of-Paths Views. 18th International Conference on Database Theory (ICDT 2015), Mar 2015, Brussels, Belgium. ⟨10.4230/LIPIcs.ICDT.2015.44⟩. ⟨hal-01150780⟩

Share

Metrics

Record views

228

Files downloads

138