An analysis of the feasibility of graph compression techniques for indexing regular path qeries
Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Contributed › peer-review
Contributors
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.
Details
| Original language | English |
|---|---|
| Title of host publication | 5th International Workshop on Graph Data Management Experiences and Systems, GRADES 2017 - Co-located with SIGMOD/PODS 2017 |
| Publisher | Association for Computing Machinery, Inc |
| ISBN (electronic) | 9781450350389 |
| Publication status | Published - 19 May 2017 |
| Peer-reviewed | Yes |
Conference
| Title | 5th International Workshop on Graph Data Management Experiences and Systems, GRADES 2017 |
|---|---|
| Duration | 19 May 2017 |
| City | Chicago |
| Country | United States of America |
External IDs
| ORCID | /0000-0001-8107-2775/work/142253525 |
|---|
Keywords
ASJC Scopus subject areas
Keywords
- Graph Processing, Index Compression, Regular Path Queries