Expressive Languages for Path Queries over Graph-Structured Data

  • Authors:

  • Pablo Barceló;Leonid Libkin;Anthony W. Lin;Peter T. Wood

  • Affiliations:

  • University of Chile;University of Edinburgh;University of Oxford;Birkbeck, University of London

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.), the power of standard languages such as the widely studied conjunctive regular path queries (CRPQs) is insufficient in at least two ways. First, they cannot output paths and second, more crucially, they cannot express relationships among paths. We thus propose a class of extended CRPQs, called ECRPQs, which add regular relations on tuples of paths, and allow path variables in the heads of queries. We provide several examples of their usefulness in querying graph structured data, and study their properties. We analyze query evaluation and representation of tuples of paths in the output by means of automata. We present a detailed analysis of data and combined complexity of queries, and consider restrictions that lower the complexity of ECRPQs to that of relational conjunctive queries. We study the containment problem, and look at further extensions with first-order features, and with nonregular relations that add arithmetic constraints on the lengths of paths and numbers of occurrences of labels.