Nicholas P. Roth
Vasileios Trigonakis
Hassan Chafi
ABSTRACT
Graph querying and pattern matching is becoming an important feature of graph processing as it allows data analysts to easily collect and understand information about their graphs in a way similar to SQL for databases. One of the key challenges in graph pattern matching is to process increasingly large graphs that often do not fit in the memory of a single machine. In this paper, we present PGX.D/Async, a scalable distributed pattern matching engine for property graphs that is able to handle very large datasets. PGX.D/Async implements pattern matching operations with asynchronous depth-first traversal, allowing for a high degree of parallelism and precise control over memory consumption. In PGX.D/Async, developers can query graphs with PGQL, an SQL-like query language for property graphs. Essentially, PGX.D/Async provides an intuitive, distributed, in-memory pattern matching engine for very large graphs.
- AllegroGraph. http://franz.com/agraph/allegrograph/.Google Scholar
- Apache Giraph Project. http://giraph.apache.org.Google Scholar
- Boost Graph Library (BGL). http://www.boost.org/doc/libs/_1_55_0/libs/graph/-doc/index.html.Google Scholar
- Cypher - the Neo4j query Language. http://www.neo4j.org/learn/cypher.Google Scholar
- InfiniteGraph. http://www.objectivity.com/infinitegraph.Google Scholar
- Java universal network/graph framework. http://jung.sourceforge.net.Google Scholar
- Neo4j graph database. http://www.neo4j.org/.Google Scholar
- NetworkX. https://networkx.github.io.Google Scholar
- Oracle Spatial and Graph, RDF Semantic Graph,. http://www.oracle.com/technetwork/database/options/spatialandgraph/overview/rdfsemantic-graph-1902016.html.Google Scholar
- PGQL: Property Graph Query Language. http://pgql-lang.org/.Google Scholar
- SPARQL Query Language for RDF. http://www.w3.org/TR/rdf-sparql-query/.Google Scholar
- Virtuoso Universal Server. http://virtuoso.openlinksw.com/.Google Scholar
- Bizer, C., and Schultz, A. The Berlin SPARQL Benchmark. Int. J. Semantic Web Inf. Syst. (2009).Google Scholar
- Dave, A., Jindal, A., Li, L. E., Xin, R., Gonzalez, J., and Zaharia, M. GraphFrames: An Integrated API for Mixing Graph and Relational Queries. In GRADES (2016). Google ScholarDigital Library
- Ediger, D., McColl, R., Riedy, J., and Bader, D. A. STINGER: High Performance Data Structure for Streaming Graphs. In HPEC (2012).Google Scholar
- Graefe, G., and Davison, D. L. Encapsulation of Parallelism and Architecture-Independence in Extensible Database Query Execution. IEEE Trans. Software Eng. (1993). Google ScholarDigital Library
- Gurajada, S., Seufert, S., Miliaraki, I., and Theobald, M. TriAD: A Distributed Shared-Nothing RDF Engine Based on Asynchronous Message Passing. In SIGMOD (2014). Google ScholarDigital Library
- Hong, S., Depner, S., Manhardt, T., Lugt, J., Verstraaten, M., and Chafi, H. PGX.D: A Fast Distributed Graph Processing Engine. In SC (2015). Google ScholarDigital Library
- Kang, U., Tsourakakis, C. E., and Faloutsos, C. Pegasus: A peta-scale graph mining system implementation and observations. In ICDM (2009). Google ScholarDigital Library
- Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., and Hellerstein, J. Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud. PVLDB (2012). Google ScholarDigital Library
- Malewicz, G., Austern, M. H., Bik, A. J., Dehnert, J. C., Horn, I., Leiser, N., and Czajkowski, G. Pregel: A System for Large-scale Graph Processing. In SIGMOD (2010). Google ScholarDigital Library
- Nguyen, D., Lenharth, A., and Pingali, K. A Lightweight Infrastructure for Graph Analytics. In SOSP (2013). Google ScholarDigital Library
- Potter, A., Motik, B., Nenov, Y., and Horrocks, I. Distributed RDF Query Answering with Dynamic Data Exchange. In ISWC (2016).Google Scholar
- Sevenich, M., Hong, S., van Rest, O., Wu, Z., Banerjee, J., and Chafi, H. Using Domain-Specific Languages For Analytic Graph Databases. PVLDB (2016). Google ScholarDigital Library
- Sevenich, M., Hong, S., Welc, A., and Chafi, H. Fast In-Memory Triangle Listing for Large Real-World Graphs. In SNAKDD (2014). Google ScholarDigital Library
- Sundaram, N., Satish, N., Patwary, M. M. A., Dulloor, S., Anderson, M. J., Vadlamudi, S. G., Das, D., and Dubey, P. GraphMat: High Performance Graph Analytics Made Productive. PVLDB (2015). Google ScholarDigital Library
- van Rest, O., Hong, S., Kim, J., Meng, X., and Chafi, H. PGQL: A Property Graph Query Language. In GRADES (2016). Google ScholarDigital Library
- Zeng, K., Yang, J., Wang, H., Shao, B., and Wang, Z. A Distributed Graph Engine for Web Scale RDF Data. PVLDB (2013). Google ScholarDigital Library
Recommendations
PGX.D: a fast distributed graph processing engine
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and AnalysisGraph analysis is a powerful method in data analysis. Although several frameworks have been proposed for processing large graph instances in distributed environments, their performance is much lower than using efficient single-machine implementations ...
On the Multichromatic Number of s-Stable Kneser Graphs
For positive integers n and s, a subset Sï [n] is s-stable if sï |i-j|ï n-s for distinct i,j∈S . The s-stable r-uniform Kneser hypergraph KGrn,ks-stable is the r-uniform hypergraph that has the collection of all s-stable k-element subsets of [n] as ...
Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
An adjacent vertex-distinguishing edge coloring of a simple graph G is a proper edge coloring of G such that incident edge sets of any two adjacent vertices are assigned different sets of colors. A total coloring of a graph G is a coloring of both the ...
Comments