Cart (Loading....) | Create Account
Close category search window
 

Distributed graph query processing in dynamic networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

In this paper we examine a popular network computational model (BSP: Bulk Synchronous Parallel) that has been adopted by the Google Pregel system to support large scale graph processing. We show that the synchronicity assumption made by the BSP model, while acceptable in data center like environments with strong and persistent network connectivity, can result in severe performance penalties in the context of dynamic networks. We introduce a new computational model (BAP: Bulk Asynchronous Parallel) that preserves the bulk and parallel nature of the BSP model but extends the model to asynchronous network communication. We consider two popular classes of graph queries (random walk queries and shortest path queries), present both BSP and BAP algorithms for these queries and evaluate their performance using realistic graphs datasets (DBLP and Flickr) and dynamic network datasets (Infocom06 and MIT Reality dataset). Our initial results show that in dynamic networks BAP algorithms can achieve several orders of magnitude in improvement for various QoI metrics such as accuracy and latency of (partial and complete) query evaluation.

Published in:

Pervasive Computing and Communications Workshops (PERCOM Workshops), 2012 IEEE International Conference on

Date of Conference:

19-23 March 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.