View-based query determinacy and rewritings over graph databases

Nadime Francis 1, 2
2 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 : Graph databases appear naturally in various scenarios, such as social networks and the semantic Web. In these cases, the information contained in the database lies as much in the data itself as in the topology of the graph, that is, in how the data points are linked together. This leads to considering traditional database theory questions for query languages that return data nodes based on the paths of the graph connecting them. We focus our attention on the view-based query determinacy and rewriting problems. They ask the question whether a view of the database contains enough information to fully answer a query without accessing the database directly. If so, we then want to express the answer to the query directly with regards to the view. This setting occurs in many applications, such as data integration and query optimization. We start by comparing these two tasks to other common task in this setting: computing certain answers, checking consistency of a view instance and updating it. We then build on these results in two specific cases. First, we show that for regular path queries, the existence of a monotone rewriting coincides with the existence of a rewriting expressible in Datalog. Then, we show that for views that only consider the lengths of the path in the graph, we can decide a weaker form of determinacy, called asymptotic determinacy, and produce first-order rewritings for the queries that are asymptotically determined.
Document type :
Theses
Complete list of metadatas

Cited literature [43 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/tel-01247115
Contributor : Abes Star <>
Submitted on : Wednesday, January 6, 2016 - 1:45:09 PM
Last modification on : Tuesday, April 16, 2019 - 8:56:21 AM

File

73123_FRANCIS_2015_archivage.p...
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01247115, version 2

Citation

Nadime Francis. View-based query determinacy and rewritings over graph databases. Databases [cs.DB]. Université Paris-Saclay, 2015. English. ⟨NNT : 2015SACLN015⟩. ⟨tel-01247115v2⟩

Share

Metrics

Record views

793

Files downloads

290