Presentation 2011-06-06
Towards Incremental Graph Processing by Data Stream Processing
Shunsuke NISHII, Toyotaro SUZUMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose incremental graph processing using data stream processing, for effective analysis of large graph that evolves. We propose computation model "Incremental GIM-V" for this analysis, implement graph processing system using IBM System S, one of Data Stream Management System (DSMS), and evaluate its performance. Then we discuss more effective and more generally usable way to data stream graph processing. In evaluation about PageRank on artificial data, when the rate of range spread from changing graph points equals to or less than 50%, incremental graph processing makes computation speed 3.0~ times faster.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Data Stream Processing / Graph Processing / PageRank / DSMS / DSPS / System S / SPADE
Paper # DE2011-8,PRMU2011-39
Date of Issue

Conference Information
Committee DE
Conference Date 2011/5/30(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Towards Incremental Graph Processing by Data Stream Processing
Sub Title (in English)
Keyword(1) Data Stream Processing
Keyword(2) Graph Processing
Keyword(3) PageRank
Keyword(4) DSMS
Keyword(5) DSPS
Keyword(6) System S
Keyword(7) SPADE
1st Author's Name Shunsuke NISHII
1st Author's Affiliation Tokyo Institute of Technology()
2nd Author's Name Toyotaro SUZUMURA
2nd Author's Affiliation Tokyo Institute of Technology:IBM Research - Tokyo
Date 2011-06-06
Paper # DE2011-8,PRMU2011-39
Volume (vol) vol.111
Number (no) 76
Page pp.pp.-
#Pages 6
Date of Issue