SQLGraph
Wen Sun, Achille Fokoue, Kavitha Srinivas et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 2015
We show that existing mature, relational optimizers can be exploited with a novel schema to give better performance for property graph storage and retrieval than popular noSQL graph stores. The schema combines relational storage for adjacency information with JSON storage for vertex and edge attributes. We demonstrate that this particular schema design has benefits compared to a purely relational or purely JSON solution. The query translation mechanism translates Gremlin queries with no side effects into SQL queries so that one can leverage relational query optimizers. We also conduct an empirical evaluation of our schema design and query translation mechanism with two existing popular property graph stores. We show that our system is 2-8 times better on query performance, and 10-30 times better in throughput on 4.3 billion edge graphs compared to existing stores.
Cited by 90 works. doi:10.1145/2723372.2723732
Authors
References
- LUBM: A benchmark for OWL knowledge base systems
- Scalable Semantic Web Data Management Using Vertical Partitioning
- Efficient RDF storage and retrieval in Jena2
- The Berlin SPARQL Benchmark
- RDF-3X
- SP^2Bench: A SPARQL Performance Benchmark
- SPARQL basic graph pattern optimization using selectivity estimation
- Scalable SPARQL querying of large RDF graphs
- LinkBench
- A Survey of Current Approaches for Mapping of Relational Databases to RDF