TigerGraph outperforms Neo4j on most of the 46 LDBC SNB queries by up to 100x, scales to SF-1000 while Neo4j does not, and Neo4j loads smaller graphs faster.
Property Graph Type System and Data Definition Language
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Property graph manages data by vertices and edges. Each vertex and edge can have a property map, storing ad hoc attribute and its value. Label can be attached to vertices and edges to group them. While this schema-less methodology is very flexible for data evolvement and for managing explosive graph element, it has two shortcomings-- 1) data dependency 2) less compression. Both problems can be solved by a schema based approach. In this paper, a type system used to model property graph is defined. Based on the type system, the associated data definition language (DDL) is proposed and multiple graph instances created under this type system is discussed.
fields
cs.DB 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
In-Depth Benchmarking of Graph Database Systems with the Linked Data Benchmark Council (LDBC) Social Network Benchmark (SNB)
TigerGraph outperforms Neo4j on most of the 46 LDBC SNB queries by up to 100x, scales to SF-1000 while Neo4j does not, and Neo4j loads smaller graphs faster.