Return to search

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

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.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:79449
Date13 June 2022
CreatorsTetzel, Frank, Voigt, Hannes, Paradies, Marcus, Lehner, Wolfgang
PublisherACM
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/acceptedVersion, doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess
Relation978-1-4503-5038-9, 11, 10.1145/3078447.3078458

Page generated in 0.0012 seconds