Facilitating real-time graph mining

Zhuhua Cai, Dionysios Logothetis, Georgos Siganos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

Real-time data processing is increasingly gaining momentum as the preferred method for analytical applications. Many of these applications are built on top of large graphs with hundreds of millions of vertices and edges. A fundamental requirement for real-time processing is the ability to do incremental processing. However, graph algorithms are inherently difficult to compute incrementally due to data dependencies. At the same time, devising incremental graph algorithms is a challenging programming task. This paper introduces GraphInc, a system that builds on top of the Pregel model and provides efficient incremental processing of graphs. Importantly, GraphInc supports incremental computations automatically, hiding the complexity from the programmers. Programmers write graph analytics in the Pregel model without worrying about the continuous nature of the data. GraphInc integrates new data in real-time in a transparent manner, by automatically identifying opportunities for incremental processing. We discuss the basic mechanisms of GraphInc and report on the initial evaluation of our approach.

Original languageEnglish
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
Pages1-8
Number of pages8
DOIs
Publication statusPublished - 10 Dec 2012
Externally publishedYes
Event3rd ACM International Workshop on Cloud Data Management, CloudDB 2012 - Co-located with CIKM 2012 - Maui, HI, United States
Duration: 29 Oct 201229 Oct 2012

Other

Other3rd ACM International Workshop on Cloud Data Management, CloudDB 2012 - Co-located with CIKM 2012
CountryUnited States
CityMaui, HI
Period29/10/1229/10/12

Fingerprint

Incremental
Graph mining
Graph
Evaluation
Programming
Momentum

Keywords

  • Graph mining
  • Incremental processing
  • Memoization

ASJC Scopus subject areas

  • Business, Management and Accounting(all)
  • Decision Sciences(all)

Cite this

Cai, Z., Logothetis, D., & Siganos, G. (2012). Facilitating real-time graph mining. In International Conference on Information and Knowledge Management, Proceedings (pp. 1-8) https://doi.org/10.1145/2390021.2390023

Facilitating real-time graph mining. / Cai, Zhuhua; Logothetis, Dionysios; Siganos, Georgos.

International Conference on Information and Knowledge Management, Proceedings. 2012. p. 1-8.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cai, Z, Logothetis, D & Siganos, G 2012, Facilitating real-time graph mining. in International Conference on Information and Knowledge Management, Proceedings. pp. 1-8, 3rd ACM International Workshop on Cloud Data Management, CloudDB 2012 - Co-located with CIKM 2012, Maui, HI, United States, 29/10/12. https://doi.org/10.1145/2390021.2390023
Cai Z, Logothetis D, Siganos G. Facilitating real-time graph mining. In International Conference on Information and Knowledge Management, Proceedings. 2012. p. 1-8 https://doi.org/10.1145/2390021.2390023
Cai, Zhuhua ; Logothetis, Dionysios ; Siganos, Georgos. / Facilitating real-time graph mining. International Conference on Information and Knowledge Management, Proceedings. 2012. pp. 1-8
@inproceedings{fbd7cd74ae514e2ca391cf1bea09e0e6,
title = "Facilitating real-time graph mining",
abstract = "Real-time data processing is increasingly gaining momentum as the preferred method for analytical applications. Many of these applications are built on top of large graphs with hundreds of millions of vertices and edges. A fundamental requirement for real-time processing is the ability to do incremental processing. However, graph algorithms are inherently difficult to compute incrementally due to data dependencies. At the same time, devising incremental graph algorithms is a challenging programming task. This paper introduces GraphInc, a system that builds on top of the Pregel model and provides efficient incremental processing of graphs. Importantly, GraphInc supports incremental computations automatically, hiding the complexity from the programmers. Programmers write graph analytics in the Pregel model without worrying about the continuous nature of the data. GraphInc integrates new data in real-time in a transparent manner, by automatically identifying opportunities for incremental processing. We discuss the basic mechanisms of GraphInc and report on the initial evaluation of our approach.",
keywords = "Graph mining, Incremental processing, Memoization",
author = "Zhuhua Cai and Dionysios Logothetis and Georgos Siganos",
year = "2012",
month = "12",
day = "10",
doi = "10.1145/2390021.2390023",
language = "English",
isbn = "9781450317085",
pages = "1--8",
booktitle = "International Conference on Information and Knowledge Management, Proceedings",

}

TY - GEN

T1 - Facilitating real-time graph mining

AU - Cai, Zhuhua

AU - Logothetis, Dionysios

AU - Siganos, Georgos

PY - 2012/12/10

Y1 - 2012/12/10

N2 - Real-time data processing is increasingly gaining momentum as the preferred method for analytical applications. Many of these applications are built on top of large graphs with hundreds of millions of vertices and edges. A fundamental requirement for real-time processing is the ability to do incremental processing. However, graph algorithms are inherently difficult to compute incrementally due to data dependencies. At the same time, devising incremental graph algorithms is a challenging programming task. This paper introduces GraphInc, a system that builds on top of the Pregel model and provides efficient incremental processing of graphs. Importantly, GraphInc supports incremental computations automatically, hiding the complexity from the programmers. Programmers write graph analytics in the Pregel model without worrying about the continuous nature of the data. GraphInc integrates new data in real-time in a transparent manner, by automatically identifying opportunities for incremental processing. We discuss the basic mechanisms of GraphInc and report on the initial evaluation of our approach.

AB - Real-time data processing is increasingly gaining momentum as the preferred method for analytical applications. Many of these applications are built on top of large graphs with hundreds of millions of vertices and edges. A fundamental requirement for real-time processing is the ability to do incremental processing. However, graph algorithms are inherently difficult to compute incrementally due to data dependencies. At the same time, devising incremental graph algorithms is a challenging programming task. This paper introduces GraphInc, a system that builds on top of the Pregel model and provides efficient incremental processing of graphs. Importantly, GraphInc supports incremental computations automatically, hiding the complexity from the programmers. Programmers write graph analytics in the Pregel model without worrying about the continuous nature of the data. GraphInc integrates new data in real-time in a transparent manner, by automatically identifying opportunities for incremental processing. We discuss the basic mechanisms of GraphInc and report on the initial evaluation of our approach.

KW - Graph mining

KW - Incremental processing

KW - Memoization

UR - http://www.scopus.com/inward/record.url?scp=84870538322&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870538322&partnerID=8YFLogxK

U2 - 10.1145/2390021.2390023

DO - 10.1145/2390021.2390023

M3 - Conference contribution

SN - 9781450317085

SP - 1

EP - 8

BT - International Conference on Information and Knowledge Management, Proceedings

ER -