SlideShare is now on Android. 15 million presentations at your fingertips.  Get the app

×
  • Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
 

WOOster: A Map-Reduce based Platform for Graph Mining

by on May 20, 2012

  • 1,197 views

Large scale graphs containing O(billion) of vertices...

Large scale graphs containing O(billion) of vertices
are becoming increasingly common in various applica-
tions. With graphs of such proportion, efficient query-
ing infrastructure becomes crucial. In this paper, we
propose WOOster a hosted querying infrastructure de-
signed specifically for the large graphs. We make two
key contributions: a) Design of the WOOster frame-
work. b)Scalable map-reduce algorithms for two pop-
ular graph queries: sub-graph match and reachability.
Our experiments show that the proposed map-reduce
algorithms scale well with large synthetic datasets.

Statistics

Views

Total Views
1,197
Views on SlideShare
1,187
Embed Views
10

Actions

Likes
0
Downloads
24
Comments
0

2 Embeds 10

http://www.linkedin.com 9
http://www.slashdocs.com 1

Accessibility

Categories

Upload Details

Uploaded via SlideShare as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
Post Comment
Edit your comment

WOOster: A Map-Reduce based Platform for Graph Mining WOOster: A Map-Reduce based Platform for Graph Mining Presentation Transcript