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

Nadime Francis 1
1 DAHU - Verification in databases
CNRS - Centre National de la Recherche Scientifique : UMR8643, Inria Saclay - Ile de France, ENS Cachan - École normale supérieure - Cachan, LSV - Laboratoire Spécification et Vérification [Cachan]
Abstract : We consider the view-based query determinacy problem over graph databases for queries defined as 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 :
Journal articles
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download
Contributor : Nadime Francis <>
Submitted on : Wednesday, May 30, 2018 - 1:26:00 PM
Last modification on : Thursday, February 7, 2019 - 5:29:34 PM
Long-term archiving on : Friday, August 31, 2018 - 3:50:37 PM


Files produced by the author(s)



Nadime Francis. Asymptotic Determinacy of Path Queries using Union-of-Paths Views. Theory of Computing Systems, Springer Verlag, 2017, 61 (1), pp.156-190. ⟨10.1007/s00224-016-9697-x⟩. ⟨hal-01803445⟩



Record views


Files downloads