Detailed Information on Publication Record
2006
M-Grid: Similarity Searching in Grids
BATKO, Michal, Vlastislav DOHNAL and Pavel ZEZULABasic information
Original name
M-Grid: Similarity Searching in Grids
Name in Czech
M-Grid: podobnostní hledání v Gridech
Authors
BATKO, Michal (203 Czech Republic, belonging to the institution), Vlastislav DOHNAL (203 Czech Republic, guarantor, belonging to the institution) and Pavel ZEZULA (203 Czech Republic, belonging to the institution)
Edition
1. vyd. Arlington, Proceedings of International Workshop on Information Retrieval in Peer-to-Peer Networks, ACM CIKM 2006, p. 17-24, 8 pp. 2006
Publisher
ACM Press
Other information
Language
English
Type of outcome
Stať ve sborníku
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í
Publication form
printed version "print"
RIV identification code
RIV/00216224:14330/06:00015399
Organization unit
Faculty of Informatics
ISBN
1-59593-531-2
Keywords in English
similarity searching; metric space; M-Grid; D-index; performance analysis
Tags
International impact, Reviewed
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.
In Czech
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.
Links
| 1ET100300419, research and development project |
|