Dynamic Storage Balancing in a Distributed Spatial Index

We propose a general framework to index very large datasets of spatialdata in a distributed system. Our proposal is built on the recently proposedScalable Distributed Rtree (SD-Rtree)~\cite{MLR07} and addresses specifically theserver allocation problem. In SD-Rtree, a new server isassigned to the network whenever a split of a full node isrequired. We describe a more flexible allocation protocol whichcopes with a temporary shortage of storage resources. Our algorithm isespecially based on $k$-NN query processing we introduce as well. We analyzethe cost of this protocol, describe its features, and proposepractical hints to use it. We also present experiments validating our approach

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) [5] 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. 1