Dynamic storage balancing in a distributed spatial index

@inproceedings{Mouza2007DynamicSB,
  title={Dynamic storage balancing in a distributed spatial index},
  author={C{\'e}dric du Mouza and Witold Litwin and Philippe Rigaux},
  booktitle={GIS},
  year={2007}
}
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) [4] 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… CONTINUE READING