Sharif Digital Repository

This thesis presents a dynamic multidimensional data structure, which is called Improved Skip Quadtree for peer-to peer networks. This data structure is the Improved version of Skip Quadtree which originally presented jointly by D.Eppstein, M.T.Goodrich, and J.Z.Sun. It tries to combine the best features of two well-known data structures; hieracical structure search quadtree, and skip list. In this thesis, it is tried to focus on algorithms for inserting and deleting points in both skip quadtree and Improved skip quadtree, which is fast method for performing point location and approximate range queries. The result of experimentation and implementation of this structure shows that it can be...