STORING AND INDEXING SPATIAL DATA IN P2P SYSTEMS
The peer-to-peer (P2P) paradigm has become very popular for storing and sharing information in a totally decentralized manner. At first, research focused on P2P systems that host 1D data. Nowadays, the need for P2P applications with multidimensional data has emerged, motivating research on P2P systems that manage such data. The majority of the proposed techniques are based either on the distribution of centralized indexes or on the reduction of multidimensional data to one dimension. Our goal is to create from scratch a technique that is inherently distributed and also maintains the multidimensionality of data. Our focus is on structured P2P systems that share spatial information. We present SPATIALP2P, a totally decentralized indexing and searching framework that is suitable for spatial data. SPATIALP2P supports P2P applications in which spatial information of various sizes can be dynamically inserted or deleted, and peers can join or leave. The proposed technique preserves well locality and directionality of space.
THE peer-to-peer (P2P) paradigm has become very popular for storing and sharing information in a totally decentralized manner. Typically, a P2P system is a distributed environment formed by autonomous peers that operate in an independent manner. Each peer stores a part of the available information and maintains links (indexes) to other peers. P2P systems Until recently, research has focused mostly on P2P systems that handle 1D data such as strings and numbers. However, the need for P2P applications that manage multidimensional data has emerged. These systems pose additional requirements that stem from the particularities of such data. In centralized multidimensional applications, information is stored according to its multidimensional extent using an indexing structure (e.g., R-tree). Typically, these structures preserve the locality and the...
Please join StudyMode to read the full document