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

HBaseCon 2012 | Storing and Manipulating Graphs in HBase

by on May 30, 2012

  • 3,884 views

Google’s original use case for BigTable was the storage and processing of web graph information, represented as sparse matrices. However, many organizations tend to treat HBase as merely a “web ...

Google’s original use case for BigTable was the storage and processing of web graph information, represented as sparse matrices. However, many organizations tend to treat HBase as merely a “web scale” RDBMS. This session will cover several use cases for storing graph data in HBase, including social networks and web link graphs, MapReduce processes like cached traversal, PageRank, and clustering and lastly will look at some lower-level modeling details like row key and column qualifier design, using FullContact’s graph processing systems as a real-world use case.

Statistics

Views

Total Views
3,884
Views on SlideShare
3,615
Embed Views
269

Actions

Likes
24
Downloads
182
Comments
3

3 Embeds 269

http://www.cloudera.com 190
http://www.scoop.it 75
http://blog.cloudera.com 4

Accessibility

Categories

Upload Details

Uploaded via SlideShare as Adobe PDF

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

13 of 3 previous next Post a comment

Post Comment
Edit your comment

HBaseCon 2012 | Storing and Manipulating Graphs in HBase HBaseCon 2012 | Storing and Manipulating Graphs in HBase Presentation Transcript