D 2005

A Scalable Nearest Neighbor Search in P2P Systems

BATKO, Michal, Claudio GENNARO and Pavel ZEZULA

Basic information

Original name

A Scalable Nearest Neighbor Search in P2P Systems

Name in Czech

Škálovatelné hledaní nejbližších sousedů v P2P systémech

Authors

BATKO, Michal (203 Czech Republic, belonging to the institution), Claudio GENNARO (380 Italy) and Pavel ZEZULA (203 Czech Republic, guarantor, belonging to the institution)

Edition

Berlin, 2nd International VLDB Workshop on Databases, Information Systems and Peer-to-Peer Computing. Revised Selected Papers. LNCS 3367, p. 79-92, 14 pp. 2005

Publisher

Springer-Verlag Heidelberg

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

20206 Computer hardware and architecture

Country of publisher

Canada

Confidentiality degree

není předmětem státního či obchodního tajemství

RIV identification code

RIV/00216224:14610/05:00013447

Organization unit

Institute of Computer Science

ISBN

978-3-540-25233-7

UT WoS

000228552500006

Keywords in English

distributed data; scalable structures; similarity search; nearest neighbors

Tags

International impact, Reviewed
Změněno: 12/1/2011 10:08, RNDr. Michal Batko, Ph.D.

Abstract

V originále

A k-nearest neighbors search extension for distributed and scalable structure for metric data is presented.

In Czech

Rozšíření struktury pro podobnostní hledaní v P2P systémech o hledání nejbližších sousedů.

Links

1ET100300419, research and development project
Name: Inteligentní modely, algoritmy, metody a nástroje pro vytváření sémantického webu
Investor: Academy of Sciences of the Czech Republic, Intelligent Models, Algorithms, Methods and Tools for the Semantic Web (realization)