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

Frank Tetzel | Zendy; Hannes Voigt | Zendy; Marcus Paradies | Zendy; Wolfgang Lehner | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Frank Tetzel,

Hannes Voigt,

Marcus Paradies,

Wolfgang Lehner

Publication year - 2017

Publication title -

qucosa (saxon state and university library dresden)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/3078447.3078458

Subject(s) - search engine indexing , computer science , path expression , pattern matching , graph , path (computing) , theoretical computer science , sparql , matching (statistics) , query language , data mining , information retrieval , mathematics , artificial intelligence , rdf , semantic web , programming language , statistics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research