Indexing for Graph Query Evaluation

Given a graph, an index is a data structure supporting a map from a collection of keys to a collection of elements in the graph. For example, we may have an index on node labels, which, given a node label as search key, facilitates accelerated access to all nodes of the graph having the given label. The evaluation of queries on graph databases is often facilitated by index data structures. An index can be the primary representation of the graph or can be a secondary access path to elements of the graph.

[1]  Jan Hidders,et al.  A Structural Approach to Indexing Triples , 2012, ESWC.

[2]  Xin Wang,et al.  Query preserving graph compression , 2012, SIGMOD Conference.

[3]  Gerhard Weikum,et al.  The RDF-3X engine for scalable management of RDF data , 2010, The VLDB Journal.

[4]  Jan Hidders,et al.  Storing and Indexing Massive RDF Datasets , 2012, Semantic Search over the Web.

[5]  Huy T. Vo,et al.  The More the Merrier: Efficient Multi-Source Graph Traversal , 2014, Proc. VLDB Endow..

[6]  Lei Zou,et al.  gStore: Answering SPARQL Queries via Subgraph Matching , 2011, Proc. VLDB Endow..

[7]  Abraham Bernstein,et al.  Hexastore: sextuple indexing for semantic web data management , 2008, Proc. VLDB Endow..

[8]  Daniel J. Abadi,et al.  Scalable Pattern Matching over Compressed Graphs via Dedensification , 2016, KDD.

[9]  Yavor Nenov,et al.  Distributed RDF Query Answering with Dynamic Data Exchange , 2016, International Semantic Web Conference.

[10]  James A. Hendler,et al.  Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data , 2010, WWW '10.

[11]  Jan Hidders,et al.  Bisimulation Reduction of Big Graphs on MapReduce , 2013, BNCOD.

[12]  Sidan Gao,et al.  PrefixSolve: efficiently solving multi-source multi-destination path queries on RDF graphs by sharing suffix computations , 2013, WWW.

[13]  Vassilis Christophides,et al.  Heuristics-based query optimisation for SPARQL , 2012, EDBT '12.

[14]  George H. L. Fletcher,et al.  A methodology for coupling fragments of XPath with structural indexes for XML documents , 2009, Inf. Syst..

[15]  Shirish Tatikonda,et al.  From "Think Like a Vertex" to "Think Like a Graph" , 2013, Proc. VLDB Endow..

[16]  Martin L. Kersten,et al.  Column-store support for RDF data management: not all swans are white , 2008, Proc. VLDB Endow..

[17]  George H. L. Fletcher,et al.  Structural characterizations of the navigational expressiveness of relation algebras on a tree , 2015, J. Comput. Syst. Sci..

[18]  Haixun Wang,et al.  A Distributed Graph Engine for Web Scale RDF Data , 2013, Proc. VLDB Endow..

[19]  Jan Van den Bussche,et al.  Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations , 2012, J. Log. Comput..

[20]  Jan Hidders,et al.  External memory K-bisimulation reduction of big graphs , 2012, CIKM.

[21]  Reynold Xin,et al.  GraphX: a resilient distributed graph system on Spark , 2013, GRADES.

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

[23]  Daniel J. Abadi,et al.  Scalable SPARQL querying of large RDF graphs , 2011, Proc. VLDB Endow..

[24]  Daniel J. Abadi,et al.  SW-Store: a vertically partitioned DBMS for Semantic Web data management , 2009, The VLDB Journal.

[25]  Panos Kalnis,et al.  Evaluating SPARQL Queries on Massive RDF Datasets , 2015, Proc. VLDB Endow..

[26]  Martin Theobald,et al.  TriAD: a distributed shared-nothing RDF engine based on asynchronous message passing , 2014, SIGMOD Conference.

[27]  Sebastian Maneth,et al.  Compressing graphs by grammars , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

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

[29]  Qing Zhu,et al.  Reachability Querying: Can It Be Even Faster? , 2017, IEEE Transactions on Knowledge and Data Engineering.

[30]  Aart J. C. Bik,et al.  Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.

[31]  Peng Peng,et al.  Processing SPARQL queries over distributed RDF graphs , 2014, The VLDB Journal.

[32]  Hai Jin,et al.  TripleBit: a Fast and Compact System for Large Scale RDF Data , 2013, Proc. VLDB Endow..

[33]  Gerhard Weikum,et al.  x-RDF-3X , 2010, Proc. VLDB Endow..

[34]  Martin Theobald,et al.  Distributed Set Reachability , 2016, SIGMOD Conference.

[35]  Avery Ching,et al.  One Trillion Edges: Graph Processing at Facebook-Scale , 2015, Proc. VLDB Endow..

[36]  Richard E. Schantz,et al.  Clause-iteration with MapReduce to scalably query datagraphs in the SHARD graph-store , 2011, DIDC '11.

[37]  Sameh Elnikety,et al.  Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs , 2013, Proc. VLDB Endow..

[38]  Xin Wang,et al.  Performance Guarantees for Distributed Reachability Queries , 2012, Proc. VLDB Endow..

[39]  George H. L. Fletcher,et al.  Efficient external-memory bisimulation on DAGs , 2012, SIGMOD Conference.