12 results
Nadime Francis ; Luc Segoufin ; Cristina Sirangelo.
We consider query answering using views on graph databases, i.e. databases structured as edge-labeled graphs. We mainly consider views and queries specified by Regular Path Queries (RPQ). These are queries selecting pairs of nodes in a graph database that are connected via a path whose sequence of […]
Published on December 22, 2015
Florent Jacquemard ; Luc Segoufin ; Jerémie Dimino.
A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(<,+1,~) over data trees. Here +1 refers to the child and the next sibling relations while < refers to the […]
Published on April 26, 2016