Regular Path Queries on Large Graphs

@inproceedings{Koschmieder2012RegularPQ,
  title={Regular Path Queries on Large Graphs},
  author={Andr{\'e} Koschmieder and Ulf Leser},
  booktitle={SSDBM},
  year={2012}
}
The significance of regular path queries (RPQs) on graph-like data structures has grown steadily over the past decade. RPQs are, often in restricted forms, part of graph-oriented query languages such as XQuery/XPath and SPARQL, and have applications in areas such as semantic, social, and biomedical networks. However, existing systems for evaluating RPQs are restricted either in the type of the graph (e.g., only trees), the type of regular expressions (e.g., only single steps), and/or the size… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 28 CITATIONS

Logic, Language, Information, and Computation

  • Lecture Notes in Computer Science
  • 2018
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Implementing Flexible Operators for Regular Path Queries

VIEW 5 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Learning Path Queries on Graph Databases

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Estimating the Evaluation Cost of Regular Path Queries on Large Graphs

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Applications of Flexible Querying to Graph Data

  • Graph Data Management
  • 2018
VIEW 2 EXCERPTS
CITES METHODS & BACKGROUND

Graph Data Management

George Fletcher, Jan Hidders, Josep Lluís Larriba-Pey
  • Data-Centric Systems and Applications
  • 2018

A Distributed Implementation of GXPath

  • EDBT/ICDT Workshops
  • 2016
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 41 REFERENCES