Name
Title | ||
|---|---|---|
An Analysis of the Feasibility of Graph Compression Techniques for Indexing Regular Path Queries. |
Abstract | ||
|---|---|---|
Regular path queries (RPQs) are a fundamental part of recent graph query languages like SPARQL and PGQL. They allow the definition of recursive path structures through regular expressions in a declarative pattern matching environment. We study the use of the K2-tree graph compression technique to materialize RPQ results with low memory consumption for indexing. Compact index representations enable the efficient storage of multiple indexes for varying RPQs. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3078447.3078458 | GRADES@SIGMOD/PODS |
Field | DocType | Citations |
Graph database,Regular expression,Graph compression,Computer science,Path expression,Search engine indexing,SPARQL,Theoretical computer science,Pattern matching,Database,Recursion | Conference | 1 |
PageRank | References | Authors |
0.36 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frank Tetzel | 1 | 1 | 1.37 |
| Hannes Voigt | 2 | 68 | 19.45 |
| Marcus Paradies | 3 | 82 | 10.36 |
| Wolfgang Lehner | 4 | 2243 | 294.69 |