Implementation and Experimentation of a P2P Network for Dynamic Multidimensional Data Structure

Please enable javascript in your browser.

Moeen Taghavi, Maryam | 2009

620 Viewed

Type of Document: M.Sc. Thesis
Language: English
Document No: 39419 (52)
University: Sharif University of Technology, International Campus, Kish Island
Department: Science and Engineering
Advisor(s): Ghodsi, Mohammad
Abstract:
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 implemented on a P2P networks with good performance rather than basic Skip quadtree. All the works in this thesis including the experimental results are due for submission as a conference or journal paper in the near future
Keywords:
Data Structure ; Skip List ; Search Algorithm ; Peer-to-Peer Network ; Skip Quadtree

No TOC