Dynamic Storage Balancing in a Distributed Spatial Index - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

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.
No file

Dates and versions

hal-01125389 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01125389 , version 1

Cite

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⟩
103 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More