Name
Abstract | ||
|---|---|---|
Regular Path Queries (RPQs) are at the core of many recent declarative graph pattern matching languages. They leverage the compactness and expressiveness of regular expressions for matching recursive path structures. Unfortunately, most prior works on RPQs only consider breadth-first search as traversal strategy, neglecting other possible graph traversals like depth-first search or a combination of both. Within this paper, we conduct an analysis of graph traversals for RPQs by introducing a generalized graph traversal frame-work subsuming breadth-first search and depth-first search as extreme cases and thus opening up a new design space for graph traversals algorithms. We outline the underlying principles as well as provide comprehensive experimental evaluation using implementations which yield beneficial results regarding evaluation time and peak memory consumption.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3327964.3328494 | Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) |
Keywords | DocType | ISBN |
Experimental Evaluation, Graph Traversal, Regular Path Queries | Conference | 978-1-4503-6789-9 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frank Tetzel | 1 | 1 | 1.37 |
| Romans Kasperovics | 2 | 2 | 1.04 |
| Wolfgang Lehner | 3 | 2243 | 294.69 |