Skip to Main content Skip to Navigation
Conference papers

Dynamic Storage Balancing in a Distributed Spatial Index

Abstract : 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 (SD-Rtree)~\cite{MLR07} and addresses specifically the server allocation problem. In SD-Rtree, 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 copes with a temporary shortage of storage resources. Our algorithm is especially based on $k$-NN query processing we introduce as well. We analyze the cost of this protocol, describe its features, and propose practical hints to use it. We also present experiments validating our approach.
Document type :
Conference papers
Complete list of metadatas
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:08:09 AM
Last modification on : Wednesday, September 23, 2020 - 4:28:16 AM


  • HAL Id : hal-01125389, version 1


Cedric Du Mouza, Witold Litwin, Philippe Rigaux. Dynamic Storage Balancing in a Distributed Spatial Index. GIS'07 ACM Intl Symp. on Advances in Geographic Information Systems, Seattle, Jan 2007, X, France. pp.27-34. ⟨hal-01125389⟩



Record views