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,361
- Views on SlideShare
- 1,348
- Embed Views

### Actions

- Likes
- 0
- Downloads
- 28
- Comments
- 0

### Accessibility

### Categories

### Upload Details

Uploaded via SlideShare as Microsoft PowerPoint

### Usage Rights

© All Rights Reserved

No comments yet1Full NameComment goes here.