Asymptotic Determinacy of Path Queries using Union-of-Paths Views - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

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

Nadime Francis

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.
Fichier principal
Vignette du fichier
3.pdf (519.89 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01150780 , version 1 (11-05-2015)

Identifiers

Cite

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⟩
105 View
96 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More