
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
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 mapreduce algorithms for two pop
ular graph queries: subgraph match and reachability.
Our experiments show that the proposed mapreduce
algorithms scale well with large synthetic datasets.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment