scispace - formally typeset
Open AccessProceedings Article

GraphOne: A Data Store for Real-time Analytics on Evolving Graphs.

Reads0
Chats0
TLDR
GraphOne as mentioned in this paper is a graph data store that abstracts the graph data stores away from the specialized systems to solve the fundamental research problems associated with the data store design, and it combines two complementary graph storage formats (edge list and adjacency list) to decouple graph computations from updates.
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 GraphOne, 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 GraphOne 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. GraphOne 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. GraphOne 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.

read more

Content maybe subject to copyright    Report

Citations
More filters

What is Twitter

Proceedings ArticleDOI

CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching

TL;DR: A novel framework for subgraph listing based on Compact Embedding Cluster Index (\idx), which divides the data graph into multiple embedding clusters for parallel processing, which outperforms state-of-the-art solutions on average.
Proceedings ArticleDOI

Low-latency graph streaming using compressed purely-functional trees

TL;DR: Aspen as mentioned in this paper is a graph-streaming framework that extends the interface of Ligra with operations for updating graphs, which significantly improves on the space usage and locality of purely-functional trees.
Journal ArticleDOI

LiveGraph: a transactional graph storage system with purely sequential adjacency list scans

TL;DR: LiveGraph is presented, a graph storage system that outperforms both the best graph transactional systems and the best systems for real-time graph analytics on fresh data by ensuring that adjacency list scans, a key operation in graph workloads, are purely sequential.
Related Papers (5)