Bridging the GAP: towards approximate graph analytics

TitleBridging the GAP: towards approximate graph analytics
Publication TypeConference Paper
Year of Publication2018
AuthorsIyer, A. Padmanabha, Panda A., Venkataraman S., Chowdhury M., Akella A., Shenker S., & Stoica I.
Published inProceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)
Abstract

While there has been a tremendous interest in processing data that has an underlying graph structure, existing distributed graph processing systems take several minutes or even hours to execute popular graph algorithms. However, in several cases, providing an approximate answer is good enough. Approximate analytics is seeing considerable attention in big data due to its ability to produce timely results by trading accuracy, but they do not support graph analytics. In this paper, we bridge this gap and take a first attempt at realizing approximate graph analytics. We discuss how traditional approximate analytics techniques do not carry over to the graph usecase. Leveraging the characteristics of graph properties and algorithms, we propose a graph sparsification technique, and a machine learning based approach to choose the apt amount of sparsification required to meet a given budget. Our preliminary evaluations show encouraging results.

Acknowledgment

We would like to thank the reviewers for their valuable feedback. In addition to NSF CISE Expeditions Award CCF-1730628, this research is supported in part by DHS Award HSHQDC-16-3-00083, and gifts from Alibaba, Amazon Web Services, Ant Financial, CapitalOne, Ericsson, Facebook, Google, Huawei, Intel, Microsoft, Scotiabank, Splunk and VMware. 

URLhttps://dl.acm.org/ft_gateway.cfm?id=3210269&ftid=1978246&dwn=1&CFID=165771582&CFTOKEN=1b8ba67d2bbda4b5-C87EE8AB-EE16-D065-3BE9AC235E57A1B1
ICSI Research Group

Networking and Security