Detailed Information on Publication Record
2009
Distance browsing in distributed multimedia databases
FALCHI, Fabrizio, Claudio GENNARO, Fausto RABITTI and Pavel ZEZULABasic information
Original name
Distance browsing in distributed multimedia databases
Name in Czech
Prohledavani Vzdalenosti v distribuovanych datovych bazich
Authors
FALCHI, Fabrizio (380 Italy), Claudio GENNARO (380 Italy), Fausto RABITTI (380 Italy) and Pavel ZEZULA (203 Czech Republic, guarantor)
Edition
Future Generation Computer Systems, Amsterdam, The Netherlands, Elsevier Science, 2009, 0167-739X
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
Netherlands
Confidentiality degree
není předmětem státního či obchodního tajemství
Impact factor
Impact factor: 2.229
RIV identification code
RIV/00216224:14330/09:00029212
Organization unit
Faculty of Informatics
UT WoS
000260238300008
Keywords in English
distance; browsing;multimedia
Tags
Tags
International impact, Reviewed
Změněno: 23/6/2009 08:59, prof. Ing. Pavel Zezula, CSc.
V originále
In this paper, we present a Distributed Incremental Nearest Neighbor algorithm (DINN) for finding closest objects in an incremental fashion over data distributed among computer nodes, each able to perform its local Incremental Nearest Neighbor (local-INN) algorithm. We prove that our algorithm is optimum with respect to both the number of involved nodes and the number of local-INN invocations. An implementation of our DINN algorithm, on a real P2P system called MCAN, was used for conducting an extensive experimental evaluation on a real-life dataset.
In Czech
V tomto clanku navrhujeme distribuovanou verzi algoritmu vyhledavani neblizsich sousedu. Algoritmus je nejen distribuovany ale umi rovnez pracovat inkrementalnim zpusobem.
Links
GD102/05/H050, research and development project |
| ||
GP201/07/P240, research and development project |
| ||
GP201/08/P507, research and development project |
|