Publication details
Similarity Searching: Towards Bulk
-loading Peer-to-Peer Networks
| Basic information | |
|---|---|
| Original title: | Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks |
| Authors: | Vlastislav Dohnal, Jan Sedmidubský, Pavel Zezula, David Novák |
| Further information | |
|---|---|
| Citation: | DOHNAL, Vlastislav - SEDMIDUBSKÝ, Jan - ZEZULA, Pavel - NOVÁK, David. Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks. In 1st International Workshop on Similarity Search and Applications (SISAP 2008). Los Alamitos CA, Washington, Tokyo : IEEE Computer Society, 2008. ISBN 978-0-7695-3101-4, pp. 87-94. 11.4.2008, Cancun, Mexico. |
| Original language: | English |
| Field: | Informatika |
| WWW: |  http://www.sisap.org/ |
| Type: | Article in Proceedings |
| Keywords: | similarity search; p2p network; peer split; index structure |
Due to the exponential growth of digital data and its complexity, we need a technique which allows us to search such collections efficiently. A suitable solution is based on the peer-to-peer (P2P) network paradigm and the metric-space model of similarity. When a large volume of data is being inserted, the P2P network must expand to new peers in order to maintain its efficiency. Thus, many peers must be split. During a peer split, the data is halved and one half is migrated to a new peer. In this paper, we study the problem of peer splits and propose a specialized algorithm for speeding it up. In particular, we use the structured P2P network called the M-Chord. Search performance within a single peer is enhanced by the M-tree. In experimental evaluation, we compare the proposed algorithm with several straightforward solutions on a real network organizing 10 million images. Our algorithm provides a significant performance boost.
Related projects:
- Intelligent Models, Algorithms, Methods and Tools for the Semantic Web (realization)
- Distributed Index Structures for Similarity Searching
