G raph O ne

Author:

Kumar Pradeep1ORCID,Huang H. Howie2

Affiliation:

1. Department of Computer Science, William and Mary, Williamsburg, VA

2. Department of Electrical and Computer Engineering, George Washington University, Washington, DC

Abstract

There is a growing need to perform a diverse set of real-time analytics (batch and stream analytics) on evolving graphs to deliver the values of big data to users. The key requirement from such applications is to have a data store to support their diverse data access efficiently, while concurrently ingesting fine-grained updates at a high velocity. Unfortunately, current graph systems, either graph databases or analytics engines, are not designed to achieve high performance for both operations; rather, they excel in one area that keeps a private data store in a specialized way to favor their operations only. To address this challenge, we have designed and developed G raph O ne , a graph data store that abstracts the graph data store away from the specialized systems to solve the fundamental research problems associated with the data store design. It combines two complementary graph storage formats (edge list and adjacency list) and uses dual versioning to decouple graph computations from updates. Importantly, it presents a new data abstraction, GraphView , to enable data access at two different granularities of data ingestions (called data visibility ) for concurrent execution of diverse classes of real-time graph analytics with only a small data duplication. Experimental results show that G raph O ne is able to deliver 11.40× and 5.36× average speedup in ingestion rate against LLAMA and Stinger, the two state-of-the-art dynamic graph systems, respectively. Further, they achieve an average speedup of 8.75× and 4.14× against LLAMA and 12.80× and 3.18× against Stinger for BFS and PageRank analytics (batch version), respectively. G raph O ne also gains over 2,000× speedup against Kickstarter, a state-of-the-art stream analytics engine in ingesting the streaming edges and performing streaming BFS when treating first half as a base snapshot and rest as streaming edge in a synthetic graph. G raph O ne also achieves an ingestion rate of two to three orders of magnitude higher than graph databases. Finally, we demonstrate that it is possible to run concurrent stream analytics from the same data store.

Funder

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Hardware and Architecture

Reference97 articles.

1. [n.d.]. Friendster Network Dataset—KONECT. Retrieved from http://konect.uni-koblenz.de/networks/friendster. [n.d.]. Friendster Network Dataset—KONECT. Retrieved from http://konect.uni-koblenz.de/networks/friendster.

2. [n.d.]. Titan Graph Database. Retrieved from https://github.com/thinkaurelius/titan. [n.d.]. Titan Graph Database. Retrieved from https://github.com/thinkaurelius/titan.

3. [n.d.]. Twitter (MPI) Network Dataset—KONECT. Retrieved from http://konect.uni-koblenz.de/networks/twitter_mpi. http://konect.uni-koblenz.de/networks/twitter_mpi. [n.d.]. Twitter (MPI) Network Dataset—KONECT. Retrieved from http://konect.uni-koblenz.de/networks/twitter_mpi. http://konect.uni-koblenz.de/networks/twitter_mpi.

4. [n.d.]. Web Graphs. Retrieved from http://webdatacommons.org/hyperlinkgraph/2012-08/download.html. http://webdatacommons.org/hyperlinkgraph/2012-08/download.html. [n.d.]. Web Graphs. Retrieved from http://webdatacommons.org/hyperlinkgraph/2012-08/download.html. http://webdatacommons.org/hyperlinkgraph/2012-08/download.html.

Cited by 26 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3