A comparison of a graph database and a relational database: a data provenance perspective

Authors:
Chad Vicknair;Michael Macias;Zhendong Zhao;Xiaofei Nan;Yixin Chen;Dawn Wilkins
Affiliations:
University of Mississippi;University of Mississippi;University of Mississippi;University of Mississippi;University of Mississippi;University of Mississippi
Venue:
Proceedings of the 48th Annual Southeast Regional Conference
Year:
2010

Citing 3
Cited 8

Dynamo: amazon's highly available key-value store

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Survey of graph database models

ACM Computing Surveys (CSUR)
Bigtable: A Distributed Storage System for Structured Data

ACM Transactions on Computer Systems (TOCS)

Using graph theory to re-verify the small world theory in an online social network word

Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services
On architecture warehouses and software intelligence

FGIT'12 Proceedings of the 4th international conference on Future Generation Information Technology
Performance of graph query languages: comparison of cypher, gremlin and native access in Neo4j

Proceedings of the Joint EDBT/ICDT 2013 Workshops
The Solid* toolset for software visual analytics of program structure and metrics comprehension: From research prototype to product

Science of Computer Programming
The Solid* toolset for software visual analytics of program structure and metrics comprehension: From research prototype to product

Science of Computer Programming
Experimental Comparison of Graph Databases

Proceedings of International Conference on Information Integration and Web-based Applications & Services
A performance evaluation of open source graph databases

Proceedings of the first workshop on Parallel programming for analytics applications
One Graph to Rule Them All Software Measurement and Management

Fundamenta Informaticae - Concurrency, Specification and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Relational databases have been around for many decades and are the database technology of choice for most traditional data-intensive storage and retrieval applications. Retrievals are usually accomplished using SQL, a declarative query language. Relational database systems are generally efficient unless the data contains many relationships requiring joins of large tables. Recently there has been much interest in data stores that do not use SQL exclusively, the so-called NoSQL movement. Examples are Google's BigTable and Facebook's Cassandra. This paper reports on a comparison of one such NoSQL graph database called Neo4j with a common relational database system, MySQL, for use as the underlying technology in the development of a software system to record and query data provenance information.