Asymptotic Determinacy of Path Queries using Union-of-Paths Views - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theory of Computing Systems Année : 2017

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

Nadime Francis

Résumé

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.
Fichier principal
Vignette du fichier
tocs-asy.pdf (511.48 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01803445 , version 1 (30-05-2018)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More