Compressing streaming graph data based on triangulation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

There is a wide diversity of applications for graph compression in web data management, scientific data processing, and social data analysis. In real-life applications like social media data processing, elements in a graph, typically vertices and edges, are arriving continuously. Compressing the graph before storing it in a database is important for real-time processing and analysis, while being a challenging yet interesting problem. A streaming lossless compression method, named as STT (streaming timeliness triangulation), is introduced in this paper. It is a time-efficient method for compressing a streaming graph, which differs itself from static graph compression methods in that: (1) it’s able to compress streaming graph without occupying extra storage; (2) it can achieve both low compression ratio and high throughput over the streaming graph; (3) it supports efficient graph query processing directly over compressed graphs. Thus, it can support a wide range of streaming graph processing tasks. Empirical study over a paper co-author graph and a real-life large-scale social network graph has shown the superiority of the newly proposed method over existing static graph compression methods.

Original languageEnglish
Title of host publicationWeb Technologies and Applications - APWeb 2016 Workshops, WDMA, GAP, and SDMA, Proceedings
EditorsJia Zhu, Rong Zhang, Lijun Chang, Wenjie Zhang, Kuien Liu, Atsuyuki Morishima, Tom Z.J. Fu, Xiaoyan Yang, Zhiwei Zhang
PublisherSpringer Verlag
Pages164-175
Number of pages12
ISBN (Print)9783319458342
DOIs
StatePublished - 2016
Event18th International Conference on Web Technologies and Applications, APWeb 2016 and Workshop on 2nd International Workshop on Web Data Mining and Applications, WDMA 2016 and 1st International Workshop on Graph Analytics and Query Processing, GAP 2016 and 1st International Workshop on Spatial-temporal Data Management and Analytics, SDMA 2016 - Suzhou, China
Duration: 23 Sep 201625 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9865 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th International Conference on Web Technologies and Applications, APWeb 2016 and Workshop on 2nd International Workshop on Web Data Mining and Applications, WDMA 2016 and 1st International Workshop on Graph Analytics and Query Processing, GAP 2016 and 1st International Workshop on Spatial-temporal Data Management and Analytics, SDMA 2016
Country/TerritoryChina
CitySuzhou
Period23/09/1625/09/16

Keywords

  • Graph compression
  • Graph query
  • Social graph
  • Streaming data

Fingerprint

Dive into the research topics of 'Compressing streaming graph data based on triangulation'. Together they form a unique fingerprint.

Cite this