An Analysis of the Feasibility of Graph Compression Techniques for Indexing Regular Path Queries

Description

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.

Links & Downloads

1. urn:nbn:de:bsz:14-qucosa2-794494
2. https://tud.qucosa.de/id/qucosa%3A79449
3. https://tud.qucosa.de/api/qucosa%3A79449/attachment/ATT-0/

Tags

info:eu-repo/classification/ddc/004

ddc:004

Additional Fields

Identifer	oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:79449
Date	13 June 2022
Creators	Tetzel, Frank, Voigt, Hannes, Paradies, Marcus, Lehner, Wolfgang
Publisher	ACM
Source Sets	Hochschulschriftenserver (HSSS) der SLUB Dresden
Language	English
Detected Language	English
Type	info:eu-repo/semantics/acceptedVersion, doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text
Rights	info:eu-repo/semantics/openAccess
Relation	978-1-4503-5038-9, 11, 10.1145/3078447.3078458