Résumé en anglais

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.