Definability problems for graph query languages

Given a graph, a relation on its nodes, and a query language Q of interest, we study the Q-definability problem which amounts to deciding whether there exists a query in Q defining precisely the given relation over the given graph. Previous research has identified the complexity of FO- and CQ-definability. In this paper, we consider the definability problem for regular paths and conjunctive regular path queries (CRPQs) over labelled graphs.

[1]  Pablo Barceló,et al.  Querying graph patterns , 2011, PODS.

[2]  Marc Gyssens,et al.  How to Determine the Expressive Power of Constraints , 1999, Constraints.

[3]  Val Tannen,et al.  Provenance semirings , 2007, PODS.

[4]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[5]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[6]  Jorge Pérez,et al.  Relative Expressiveness of Nested Regular Expressions , 2012, AMW.

[7]  Balder ten Cate,et al.  A note on the product homomorphism problem and CQ-definability , 2012, ArXiv.

[8]  François Bancilhon,et al.  On the Completeness of Query Languages for Relational Data Bases , 1978, MFCS.

[9]  Leonid Libkin,et al.  Regular path queries on graphs with data , 2012, ICDT '12.

[10]  Thomas Schwentick,et al.  Inference of concise regular expressions and DTDs , 2010, TODS.

[11]  Jan Van den Bussche,et al.  Walk logic as a framework for path query languages on graph databases , 2013, ICDT '13.

[12]  Jan Paredaens,et al.  On the Expressive Power of the Relational Algebra , 1978, Inf. Process. Lett..

[13]  Anthony Widjaja Lin,et al.  Expressive Languages for Path Queries over Graph-Structured Data , 2012, TODS.

[14]  Alin Deutsch,et al.  Optimization Properties for Classes of Conjunctive Regular Path Queries , 2001, DBPL.

[15]  Dan Suciu,et al.  Query containment for conjunctive queries with regular expressions , 1998, PODS.

[16]  Rina Dechter,et al.  Structure Identification in Relational Data , 1992, Artif. Intell..

[17]  Antonella Poggi,et al.  On database query languages for K-relations , 2010, J. Appl. Log..

[18]  Wenfei Fan,et al.  Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model , 1999, DBPL.

[19]  Dario Colazzo,et al.  Efficient inclusion for a class of XML types with interleaving and counting , 2009, Inf. Syst..

[20]  Wim Martens,et al.  The complexity of evaluating path expressions in SPARQL , 2012, PODS '12.

[21]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[22]  Diego Calvanese,et al.  Containment of Conjunctive Regular Path Queries with Inverse , 2000, KR.

[23]  Ross Willard.  Testing Expressibility Is Hard , 2010, CP.

[24]  Phokion G. Kolaitis,et al.  Structure identification of Boolean relations and plain bases for co-clones , 2008, J. Comput. Syst. Sci..

[25]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[26]  George H. L. Fletcher,et al.  On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs , 2009, IEEE Transactions on Knowledge and Data Engineering.

[27]  Alberto O. Mendelzon,et al.  Finding Regular Simple Paths in Graph Databases , 1989, SIAM J. Comput..

[28]  Jan Van den Bussche,et al.  Relative expressive power of navigational querying on graphs , 2011, ICDT '11.

[29]  Frank Neven,et al.  Learning deterministic regular expressions for the inference of schemas from XML data , 2008, WWW.