Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{747814, author = {Dohnal, Vlastislav and Sedmidubský, Jan and Zezula, Pavel and Novák, David}, address = {Los Alamitos CA, Washington, Tokyo}, booktitle = {1st International Workshop on Similarity Search and Applications (SISAP 2008)}, keywords = {similarity search; p2p network; peer split; index structure}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Los Alamitos CA, Washington, Tokyo}, isbn = {978-0-7695-3101-4}, pages = {87-94}, publisher = {IEEE Computer Society}, title = {Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks}, url = {http://www.sisap.org/}, year = {2008} }
TY - JOUR ID - 747814 AU - Dohnal, Vlastislav - Sedmidubský, Jan - Zezula, Pavel - Novák, David PY - 2008 TI - Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks PB - IEEE Computer Society CY - Los Alamitos CA, Washington, Tokyo SN - 9780769531014 KW - similarity search KW - p2p network KW - peer split KW - index structure UR - http://www.sisap.org/ N2 - 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. ER -
DOHNAL, Vlastislav, Jan SEDMIDUBSKÝ, Pavel ZEZULA a David NOVÁK. Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks. In \textit{1st International Workshop on Similarity Search and Applications (SISAP 2008)}. Los Alamitos CA, Washington, Tokyo: IEEE Computer Society, 2008, s.~87-94. ISBN~978-0-7695-3101-4.
|