Benchmarking Graph Databases with Cyclone Benchmark

dc.contributor.advisor Wallapak Tavanapong
dc.contributor.author Tang, Yuanyuan
dc.contributor.department Department of Computer Science
dc.date 2018-08-11T05:11:59.000
dc.date.accessioned 2020-06-30T03:06:41Z
dc.date.available 2020-06-30T03:06:41Z
dc.date.copyright Fri Jan 01 00:00:00 UTC 2016
dc.date.embargo 2001-01-01
dc.date.issued 2016-01-01
dc.description.abstract <p>Recent years have seen advances in graph databases and graph database management systems (GDBMS). In a typical graph data model, a node represents an entity and an edge represents a relationship between two nodes. Nodes and edges typically have associated properties (attributes) and are assigned types for fast query response times. In the application domains where relationships are of importance, GDBMS increasingly gains popularity since the relationships can be explicitly modeled and easily visualized in a graph data model. To measure performance of GDBMS, a number of graph database benchmarks have been proposed. Nonetheless, these benchmarks are not yet as rigorous as those of relational database management systems (RDBMS). Inspired by Wisconsin Benchmark, we propose Cyclone Benchmark for measuring performance of graph databases in several aspects of which some have not been investigated in the literature. Our benchmark comes with (1) two data graph models: a simple model with all nodes of the same node type and a complex model with multiple node types, (2) data graph generation programs, and (3) Create, Read, Update, and Delete (CRUD) operations. The data graph generation programs create a graph structure and annotate values of node and edge attributes in the graph to allow for a study of the impact of attribute selectivity</p> <p>factors as well as a correlation between attributes. The programs generate a predefined graph structure, a random graph, or a Kronecker graph that has been shown to model real-world networks well. The read operations include several graph structure queries.</p> <p>We measured the average execution times of the proposed CRUD operations on several</p> <p>synthetic graphs generated by the benchmark with a varying number of nodes from 1,000 to 1,000,000 nodes. The graphs were stored as graphs in Neo4j, a popular native GDBMS, and as relations in MySQL, a popular RDBMS. For most CRUD operations including the graph structure queries in our benchmark, MySQL was signicantly faster than Neo4j.</p>
dc.format.mimetype application/pdf
dc.identifier archive/lib.dr.iastate.edu/etd/15820/
dc.identifier.articleid 6827
dc.identifier.contextkey 11165387
dc.identifier.doi https://doi.org/10.31274/etd-180810-5447
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath etd/15820
dc.identifier.uri https://dr.lib.iastate.edu/handle/20.500.12876/30003
dc.language.iso en
dc.source.bitstream archive/lib.dr.iastate.edu/etd/15820/Tang_iastate_0097M_15907.pdf|||Fri Jan 14 20:47:10 UTC 2022
dc.subject.disciplines Computer Sciences
dc.subject.keywords benchmark
dc.subject.keywords database management
dc.subject.keywords graph database
dc.title Benchmarking Graph Databases with Cyclone Benchmark
dc.type thesis en_US
dc.type.genre thesis en_US
dspace.entity.type Publication
relation.isOrgUnitOfPublication f7be4eb9-d1d0-4081-859b-b15cee251456
thesis.degree.discipline Computer Science
thesis.degree.level thesis
thesis.degree.name Master of Science
File
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Tang_iastate_0097M_15907.pdf
Size:
1.58 MB
Format:
Adobe Portable Document Format
Description: