Abstract
In the Big data and IoT era, graph data processing is widely used. The graph data is a kind of structural data that defined entities as vertices and described dependencies between different entities as edges. Today, a lot of graph computing systems emerge with massive diverse graph applications deployed, evaluating graph computing systems become a challenge work. Existing graph computing benchmarks are constructed with prevalent graph computing applications. However, the graph micro-benchmark is lacking, which is a key for the system fine-grained evaluation and obtaining the upper bound performance of the system. In this paper, we take graph computing applications as the combination of basic operations and user-defined operations. Then, we build the GraphBench benchmark suite with micro-benchmarks (basic operations) and component benchmarks (graph computing applications). At last, we evaluates the current mainstream graph computing frameworks with GraphBench. We found that there is no one-size-fits-all solution for the graph computing system. Using GraphBench, we can evaluate the graph computing system at the fine-grained level and get more insights.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Nai, L., Xia, Y., et al.: GraphBIG: understanding graph computing in the context of industrial solutions. In: SC 2015: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE (2015)
Erling, O., Averbuch, A., Larriba-Pey, J., et al.: The LDBC social network benchmark: interactive workload. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. ACM (2015)
Ahmad, M., Hijaz, F., Shi, Q., et al.: Crono: a benchmark suite for multithreaded graph algorithms executing on futuristic multicores. In: 2015 IEEE International Symposium on Workload Characterization. IEEE (2015)
Guo, Y., Varbanescu, A.L., Iosup, A., et al.: An empirical performance evaluation of gpu-enabled graph-processing systems. In: 2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing. IEEE (2015)
Zou, L., Mo, J., Chen, L., Özsu, M.T., Zhao, D.: gStore: answering SPARQL queries via subgraph matching. Proc. VLDB Endow. 4(8), 482–493 (2011)
Webber, J., Robinson, I.: A Programmatic Introduction to Neo4j. Addison-Wesley Professional, Boston (2018)
Developers O. OrientDB: Hybrid Document-Store and Graph NoSQL Database (2012)
Güting, R.H.: GraphDB: modeling and querying graphs in databases. VLDB 94, 12–15 (1994)
Gonzalez, J.E., Low, Y., Gu, H., et al.: Powergraph: distributed graph-parallel computation on natural graphs. In: Presented as Part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2012) (2012)
Chen, R., Shi, J., Chen, Y., et al.: Powerlyra: differentiated graph computation and partitioning on skewed graphs. In: Proceedings of the Tenth European Conference on Computer Systems. ACM (2015)
Gonzalez, J.E., Xin, R.S., Dave, A., et al.: Graphx: graph processing in a distributed dataflow framework. In: 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2014) (2014)
Zhu, X., Chen, W., Zheng, W., et al.: Gemini: a computation-centric distributed graph processing system. In: 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2016) (2016)
Eu email communication network. http://snap.stanford.edu/data/email-EuAll.html
Wikipedia talk network. http://snap.stanford.edu/data/wiki-Talk.html
Pokec social network. https://snap.stanford.edu/data/soc-Pokec.html
Livejournal social network and ground-truth communities. https://snap.stanford.edu/data/com-LiveJournal.html
Shortest path problem. https://en.wikipedia.org/wiki/
Breadth-first search. https://en.wikipedia.org/wiki/
Connected component. https://en.wikipedia.org/wiki/
K-core. https://en.wikipedia.org/wiki/
Pagerank. https://en.wikipedia.org/wiki/
Acknowledgment
This work is supported by the National Key Research and Development Plan of China Grant No. 2016YFB1000201.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, L., Yu, M. (2020). GraphBench: A Benchmark Suite for Graph Computing Systems. In: Gao, W., Zhan, J., Fox, G., Lu, X., Stanzione, D. (eds) Benchmarking, Measuring, and Optimizing. Bench 2019. Lecture Notes in Computer Science(), vol 12093. Springer, Cham. https://doi.org/10.1007/978-3-030-49556-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-49556-5_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-49555-8
Online ISBN: 978-3-030-49556-5
eBook Packages: Computer ScienceComputer Science (R0)