Efficient distributed dynamic graph system

Zaki A. ; Attia M. ; Hegazy, Doaa ; Amin S. 


© 2015 IEEE. Research has focused on static large graph management. However, most of real-world networks evolve with time. Managing these evolving networks has attracted much attention in recent years. The networks' evolved data can be kept in a dynamic graph to improve the expressiveness and the quality of search queries as well as snapshot(s) retrieval. Storing the continuous evolution of the network in a dynamic graph makes its storage size grow. Existing dynamic graph models try to limit their storage by eliminating redundant data. However, their update time increases due to the elimination step. This illustrates that there is a tradeoff between the used storage and the update time. In this work, we address the problems of improving the update time of the networks' evolved data without increasing the storage redundancy as well as minimizing the needed memory storage. This paper merges the materialization technique with the distributed graph over servers. This merge reduces the update time and minimize the needed memory storage in an efficient manner as well as providing results with a better quality.

Other data

Issue Date 2-Feb-2016
Journal 2015 IEEE 7th International Conference on Intelligent Computing and Information Systems, ICICIS 2015 
URI http://research.asu.edu.eg/123456789/1026
ISBN 9781509019496
DOI http://api.elsevier.com/content/abstract/scopus_id/84970016707

Recommend this item

CORE Recommender


Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.