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.

[1]  George H. L. Fletcher,et al.  gMark: Schema-Driven Generation of Graphs and Queries , 2015, IEEE Transactions on Knowledge and Data Engineering.

[2]  Wolfgang Lehner,et al.  GRAPHITE: an extensible graph traversal framework for relational database management systems , 2014, SSDBM.

[3]  Gonzalo Navarro,et al.  k2-Trees for Compact Web Graph Representation , 2009, SPIRE.

[4]  Szymon Grabowski,et al.  Merging Adjacency Lists for Efficient Web Graph Compression , 2011, ICMMI.

[5]  Mark H. Chignell,et al.  SwarmGuide: Towards Multiple-Query Optimization in Graph Databases , 2016, AMW.

[6]  Gérard Berry,et al.  From Regular Expressions to Deterministic Automata , 1986, Theor. Comput. Sci..

[7]  Gonzalo Navarro,et al.  Extended Compact Web Graph Representations , 2010, Algorithms and Applications.

[8]  Wolfgang Lehner,et al.  The Graph Story of the SAP HANA Database , 2013, BTW.

[9]  Ulf Leser,et al.  Regular Path Queries on Large Graphs , 2012, SSDBM.

[10]  Alberto O. Mendelzon,et al.  Finding Regular Simple Paths in Graph Databases , 1989, SIAM J. Comput..

[11]  Peter T. Wood,et al.  Query languages for graph databases , 2012, SGMD.

[12]  Jarek Gryz,et al.  Query Planning for Evaluating SPARQL Property Paths , 2016, AMW.

[13]  Jarek Gryz,et al.  WAVEGUIDE: Evaluating SPARQL Property Path Queries , 2015, EDBT.

[14]  Zahid Abul-Basher.  Multiple-Query Optimization of Regular Path Queries , 2017, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

[15]  Sungpack Hong,et al.  PGQL: a property graph query language , 2016, GRADES '16.

[16]  Holger Fröning,et al.  Highspeed Graph Processing Exploiting Main-Memory Column Stores , 2015, Euro-Par Workshops.

[17]  George H. L. Fletcher,et al.  Landmark Indexing for Evaluation of Label-Constrained Reachability Queries , 2017, SIGMOD Conference.

[18]  Gonzalo Navarro,et al.  Compact representation of Web graphs with extended functionality , 2014, Inf. Syst..

[19]  Alberto Apostolico,et al.  Graph Compression by BFS , 2009, Algorithms.

[20]  Srikanta J. Bedathur,et al.  Sparqling kleene: fast property paths in RDF-3X , 2013, GRADES.

[21]  Gerhard Weikum,et al.  FERRARI: Flexible and efficient reachability range assignment for graph indexing , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).