Abstract addresses the servers which are in its image of the structure. Some existing servers may not be in the image, due Wepropose a scalable distributed data structure (SDDS) to splits unknown from the client. The addressing may then called SD-Rtree. We intend our structurefor point and winsend a query to a server that is different from the one the dow queries over possibly large spatial datasets distributed query should address. The servers recognize such addresson clusters of interconnected servers. SD-Rtree generaling errors and forward the query among themselves, until it izes the well-known Rtree structure. It uses a distributed reaches the correct one. The client gets then a specific imbalanced binary spatial tree that scales with insertions to age adjustment message (IAM). This improves the image at potentially any number ofstorage servers through splits of least so that the addressing error does not repeat. the overloaded ones. A user/application manipulates the
SD-Rtree REF is a Scalable Distributed Data Structure (SDDS) which targets large data sets of spatial objects.