| FALCHI, Fabrizio, Claudio GENNARO and Pavel ZEZULA. Nearest neighbor search in metric spaces through Content-Addressable Networks. Information Processing and Management. ELSEVIER, 2007, 43/2007, No 1, p. 665-683, 18 pp. ISSN 0306-4573. |
Other formats:
BibTeX
LaTeX
RIS
@article{718453,
author = {Falchi, Fabrizio and Gennaro, Claudio and Zezula, Pavel},
article_number = {1},
keywords = {similarity search; scalability; peer-to-peer architecture; nearest neigbor; content addressing},
language = {eng},
issn = {0306-4573},
journal = {Information Processing and Management},
title = {Nearest neighbor search in metric spaces through Content-Addressable Networks},
url = {http://www.sciencedirect.com/science/journal/03064573},
volume = {43/2007},
year = {2007}
}
TY - JOUR
ID - 718453
AU - Falchi, Fabrizio - Gennaro, Claudio - Zezula, Pavel
PY - 2007
TI - Nearest neighbor search in metric spaces through Content-Addressable Networks
JF - Information Processing and Management
VL - 43/2007
IS - 1
SP - 665-683
EP - 665-683
PB - ELSEVIER
SN - 03064573
KW - similarity search
KW - scalability
KW - peer-to-peer architecture
KW - nearest neigbor
KW - content addressing
UR - http://www.sciencedirect.com/science/journal/03064573
N2 - Most of the peer-to-peer search techniques proposed in the recent years have focused on the single-key retrieval. However, similarity search in metric spaces represents an important paradigm for content-based retrieval in many applications. In this paper we introduce an extension of the well-known Content-Addressable Network paradigm to support storage and retrieval of more generic metric space objects.
ER -
FALCHI, Fabrizio, Claudio GENNARO and Pavel ZEZULA. Nearest neighbor search in metric spaces through Content-Addressable Networks. \textit{Information Processing and Management}. ELSEVIER, 2007, 43/2007, No~1, p.~665-683, 18 pp. ISSN~0306-4573.
|
