Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Dex: high-performance exploration on large graphs for information retrieval
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Bigtable: A Distributed Storage System for Structured Data
ACM Transactions on Computer Systems (TOCS)
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
A discussion on the design of graph database benchmarks
TPCTC'10 Proceedings of the Second TPC technology conference on Performance evaluation, measurement and characterization of complex systems
Achieving reproducibility by combining provenance with service and workflow versioning
Proceedings of the 6th workshop on Workflows in support of large-scale science
Performance of graph query languages: comparison of cypher, gremlin and native access in Neo4j
Proceedings of the Joint EDBT/ICDT 2013 Workshops
LinkBench: a database benchmark based on the Facebook social graph
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Benchmarking database systems for social network applications
First International Workshop on Graph Data Management Experiences and Systems
Database research challenges and opportunities of big graph data
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Experimental Comparison of Graph Databases
Proceedings of International Conference on Information Integration and Web-based Applications & Services
A framework for user driven data management
Information Systems
| Hi-index | 0.00 |
The analysis of the relationship among data entities has lead to model them as graphs. Since the size of the datasets has significantly grown in the recent years, it has become necessary to implement efficient graph databases that can load and manage these huge datasets. In this paper, we evaluate the performance of four of the most scalable native graph database projects (Neo4j, Jena, HypergraphDB and DEX). We implement the full HPC Scalable Graph Analysis Benchmark, and we test the performance of each database for different typical graph operations and graph sizes, showing that in their current development status, DEX and Neo4j are the most efficient graph databases.