2006
M-Grid: Similarity Searching in Grids
BATKO, Michal, Vlastislav DOHNAL a Pavel ZEZULAZákladní údaje
Originální název
M-Grid: Similarity Searching in Grids
Název česky
M-Grid: podobnostní hledání v Gridech
Autoři
BATKO, Michal (203 Česká republika, domácí), Vlastislav DOHNAL (203 Česká republika, garant, domácí) a Pavel ZEZULA (203 Česká republika, domácí)
Vydání
1. vyd. Arlington, Proceedings of International Workshop on Information Retrieval in Peer-to-Peer Networks, ACM CIKM 2006, od s. 17-24, 8 s. 2006
Nakladatel
ACM Press
Další údaje
Jazyk
angličtina
Typ výsledku
Stať ve sborníku
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Spojené státy
Utajení
není předmětem státního či obchodního tajemství
Forma vydání
tištěná verze "print"
Kód RIV
RIV/00216224:14330/06:00015399
Organizační jednotka
Fakulta informatiky
ISBN
1-59593-531-2
Klíčová slova anglicky
similarity searching; metric space; M-Grid; D-index; performance analysis
Příznaky
Mezinárodní význam, Recenzováno
Změněno: 5. 2. 2013 16:46, doc. RNDr. Vlastislav Dohnal, Ph.D.
V originále
The problem of similarity searching is nowadays attracting a lot of attention, because upcoming applications process complex data and the traditional exact match searching is not sufficient. There are efficient solutions, but they are tailored for the needs of specific data domains. General solutions, based on the metric space abstraction, are extensible, but they are designed to operate on a single computer only. Therefore, their scalability is limited and they cannot adapt to different performance requirements. In this paper, we propose a distributed access structure which is fully dynamic and exploits a Grid infrastructure. We study properties of this structure in numerous experiments. Besides, the performance tuning is analyzed with respect to user-specific requirements which include the maximum response time and the number of queries executed concurrently.
Česky
The problem of similarity searching is nowadays attracting a lot of attention, because upcoming applications process complex data and the traditional exact match searching is not sufficient. There are efficient solutions, but they are tailored for the needs of specific data domains. General solutions, based on the metric space abstraction, are extensible, but they are designed to operate on a single computer only. Therefore, their scalability is limited and they cannot adapt to different performance requirements. In this paper, we propose a distributed access structure which is fully dynamic and exploits a Grid infrastructure. We study properties of this structure in numerous experiments. Besides, the performance tuning is analyzed with respect to user-specific requirements which include the maximum response time and the number of queries executed concurrently.
Návaznosti
| 1ET100300419, projekt VaV |
|