A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
International Conference on Database Theory
We consider query answering using views on graph databases, i.e. databases structured as edge-labeled graphs. We consider views and queries specified by Regular Path Queries. These are queries selecting pairs of nodes in a graph database that are connected via a path whose sequence of edge labels belongs to some regular language. A view V determines a query Q if for all graph databases D, the view image VpDq always contains enough information to answer Q on D. In other words, there is a welldoi:10.5441/002/icdt.2014.14 dblp:conf/icdt/FrancisSS14 fatcat:6pyiif6w2zfwxmdx3zqclnpc3y