Distributed graph query processing in dynamic networks

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 environment...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Srivatsa, M., Kawadia, V., Shengqi Yang
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Availability Communication networks Computational modeling Heuristic algorithms Peer to peer computing Query processing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!