Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{692249, author = {Novák, David and Zezula, Pavel}, address = {New York, NY, USA}, booktitle = {InfoScale '06: Proceedings of the 1st international conference on Scalable information systems}, keywords = {distributed data structures; peer-to-peer; similarity search; indexing}, howpublished = {tištěná verze "print"}, language = {eng}, location = {New York, NY, USA}, isbn = {1-59593-428-6}, pages = {1-10}, publisher = {ACM Press}, title = {M-Chord: A Scalable Distributed Similarity Search Structure}, url = {http://doi.acm.org/10.1145/1146847.1146866}, year = {2006} }
TY - JOUR ID - 692249 AU - Novák, David - Zezula, Pavel PY - 2006 TI - M-Chord: A Scalable Distributed Similarity Search Structure PB - ACM Press CY - New York, NY, USA SN - 1595934286 KW - distributed data structures KW - peer-to-peer KW - similarity search KW - indexing UR - http://doi.acm.org/10.1145/1146847.1146866 N2 - The need for a retrieval based not on the attribute values but on the very data content has recently led to rise of the metric-based similarity search. The computational complexity of such a retrieval and large volumes of processed data call for distributed processing which allows to achieve scalability. In this paper, we propose M-Chord, a distributed data structure for metric-based similarity search. The structure takes advantage of the idea of a vector index method iDistance in order to transform the issue of similarity searching into the problem of interval search in one dimension. The proposed peer-to-peer organization, based on the Chord protocol, distributes the storage space and parallelizes the execution of similarity queries. Promising features of the structure are validated by experiments on the prototype implementation and two real-life datasets. ER -
NOVÁK, David a Pavel ZEZULA. M-Chord: A Scalable Distributed Similarity Search Structure. In \textit{InfoScale '06: Proceedings of the 1st international conference on Scalable information systems}. New York, NY, USA: ACM Press, 2006, s.~1-10. ISBN~1-59593-428-6.
|