Detailed Information on Publication Record
2007
Nearest neighbor search in metric spaces through Content-Addressable Networks
FALCHI, Fabrizio, Claudio GENNARO and Pavel ZEZULABasic information
Original name
Nearest neighbor search in metric spaces through Content-Addressable Networks
Name in Czech
Hledání nejbližších sousedů v metrických prostorech pomocí sítí adresovatelných obsahem
Authors
FALCHI, Fabrizio (380 Italy), Claudio GENNARO (380 Italy) and Pavel ZEZULA (203 Czech Republic, guarantor)
Edition
Information Processing and Management, ELSEVIER, 2007, 0306-4573
Other information
Language
English
Type of outcome
Článek v odborném periodiku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
United States of America
Confidentiality degree
není předmětem státního či obchodního tajemství
References:
Impact factor
Impact factor: 1.500
RIV identification code
RIV/00216224:14330/07:00024126
Organization unit
Faculty of Informatics
UT WoS
000244618900008
Keywords in English
similarity search; scalability; peer-to-peer architecture; nearest neigbor; content addressing
Tags
International impact, Reviewed
Změněno: 23/6/2009 09:28, prof. Ing. Pavel Zezula, CSc.
V originále
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.
In Czech
Článek se yaměřuje na techniky hledání nejbližších sousedů v metrických prostorech pomocí sítí adresovatelných obsahem. Jedná se o techniky P2P v kombinaci s podobnostním hledáním.
Links
1ET100300419, research and development project |
|