Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3078447.3078454 | GRADES@SIGMOD/PODS |
Field | DocType | Citations |
SQL,Graph operations,Asynchronous communication,Query language,Tree traversal,Computer science,Degree of parallelism,Theoretical computer science,Pattern matching,Scalable distributed,Database | Conference | 2 |
PageRank | References | Authors |
0.38 | 13 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicholas P. Roth | 1 | 2 | 0.38 |
| Vasileios Trigonakis | 2 | 116 | 6.43 |
| Sungpack Hong | 3 | 864 | 33.20 |
| Hassan Chafi | 4 | 1118 | 61.11 |
| Anthony Potter | 5 | 8 | 1.18 |
| Boris Motik | 6 | 4092 | 250.58 |
| Ian Horrocks | 7 | 11731 | 1086.65 |