Thumbnail

Dynamic Storage Balancing in a Distributed Spatial Index

Rigaux, Philippe; Litwin, Witold; du Mouza, Cédric (2007), Dynamic Storage Balancing in a Distributed Spatial Index, in Schneider, Markus; Shahabi, Cyrus; Samet, Hanan, 15th ACM International Symposium on Geographic Information Systems, ACM-GIS 2007, November 7-9, 2007, Seattle, Washington, USA, Proceedings, ACM, p. 8

View/Open
Type
Communication / Conférence
Date
2007
Conference title
15th ACM International Symposium on Advances in Geographic Information Systems (ACMGIS 2007)
Conference date
2007-11
Conference city
Seattle
Conference country
États-Unis
Book title
15th ACM International Symposium on Geographic Information Systems, ACM-GIS 2007, November 7-9, 2007, Seattle, Washington, USA, Proceedings
Book author
Schneider, Markus; Shahabi, Cyrus; Samet, Hanan
Publisher
ACM
ISBN
978-1-59593-914-2
Pages
8
Metadata
Show full item record
Author(s)
Rigaux, Philippe cc
Litwin, Witold
du Mouza, Cédric
Abstract (EN)
We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SDRtree) [4] and addresses specifically the server allocation problem. In the classical situation, a new server is assigned to the network whenever a split of a full node is required. We describe a more flexible allocation protocol which allows to cope with a temporary shortage of storage resources. We analyze the cost of this protocol, describe its features, and propose practical hints to use it appropriately. Experiments are also provided and discussed.
Subjects / Keywords
datasets; spatial data; distributed system