. "RIV/00216224:14330/04:00010797!RIV08-MSM-14330___" . . . "Similarity retrieval is an important paradigm for searching in environments where exact match has little meaning. Moreover, in order to enlarge the set of data types for which the similarity search can efficiently be performed, the mathematical notion of metric space provides a useful abstraction of similarity. In this paper, we present a novel access structure for similarity search in arbitrary metric spaces, called D-Index. D-Index supports easy insertions and deletions and bounded search costs for range queries with radius up to $\\rho$. D-Index also supports disk memories, thus, it is able to deal with large archives. However, the partitioning principles employed in the D-Index are not very optimal since they produce high number of empty partitions. We propose several strategies of partitioning and, finally, compare them."@en . "2004-03-29+02:00"^^ . . "Proceedings of ICDE/EDBT 2004 Joint Ph.D. Workshop, 18 March 2004, Heraklion, Greece and 29 March 2004, Boston, MA, USA" . . "Dohnal, Vlastislav" . "960-524-177-3" . "Indexov\u00E1 struktura pro podobnostn\u00ED hled\u00E1n\u00ED v metrick\u00FDch prostorech"@cs . . . "149-158" . "1"^^ . "Greece" . . . "1"^^ . . "An Access Structure for Similarity Search in Metric Spaces" . "An Access Structure for Similarity Search in Metric Spaces" . "similarity search; access structure; metric space"@en . "14330" . "Podobnost\u00ED hled\u00E1n\u00ED je d\u016Fle\u017Eit\u00E9 v prost\u0159ed\u00EDch, ve kter\u00FDch hled\u00E1n\u00ED na p\u0159esnou shodu m\u00E1 mal\u00FD v\u00FDznam. Pro zv\u00FD\u0161en\u00ED okruhu aplikovatelnosti podobnostn\u00EDho hled\u00E1n\u00ED se jako matematick\u00E1 abstrakce pou\u017E\u00EDv\u00E1 pojem metrick\u00E9ho prostoru. V tomto \u010Dl\u00E1nku popisujeme novou indexovou metodu pro podobnostn\u00ED hled\u00E1n\u00ED nazvanou D-Index. D-Index vkl\u00E1d\u00E1 a ma\u017Ee datov\u00E9 objekty s velmi n\u00EDzk\u00FDmi n\u00E1klady. Rozsahov\u00E9 dotazy s polom\u011Brem men\u0161\u00EDm ne\u017E rho jsou \u0159e\u0161eny v \u010Dase, kter\u00FD je shora omezen\u00FD. D-Index tak\u00E9 podporuje diskov\u00E1 \u00FAlo\u017Ei\u0161t\u011B a t\u00EDm je schopen pracovat i s velk\u00FDmi objemy dat, kter\u00E9 p\u0159ekra\u010Duj\u00ED velikost vnit\u0159n\u00ED pam\u011Bti. Proto\u017Ee metody pro d\u011Blen\u00ED prostoru pou\u017Eit\u00E9 v D-Indexu nejsou p\u0159\u00EDli\u0161 optim\u00E1ln\u00ED a vytv\u00E1\u0159ej\u00ED velk\u00E9 mno\u017Estv\u00ED pr\u00E1zdn\u00FDch oblast\u00ED, navrhujeme n\u011Bkolik metod d\u011Blen\u00ED a porovn\u00E1v\u00E1me je."@cs . "RIV/00216224:14330/04:00010797" . . "An Access Structure for Similarity Search in Metric Spaces"@en . . "An Access Structure for Similarity Search in Metric Spaces"@en . . "Crete University Press" . . "Z(MSM 143300004)" . "Boston, MA, USA" . "10"^^ . "Similarity retrieval is an important paradigm for searching in environments where exact match has little meaning. Moreover, in order to enlarge the set of data types for which the similarity search can efficiently be performed, the mathematical notion of metric space provides a useful abstraction of similarity. In this paper, we present a novel access structure for similarity search in arbitrary metric spaces, called D-Index. D-Index supports easy insertions and deletions and bounded search costs for range queries with radius up to $\\rho$. D-Index also supports disk memories, thus, it is able to deal with large archives. However, the partitioning principles employed in the D-Index are not very optimal since they produce high number of empty partitions. We propose several strategies of partitioning and, finally, compare them." . . "Indexov\u00E1 struktura pro podobnostn\u00ED hled\u00E1n\u00ED v metrick\u00FDch prostorech"@cs . . "[8523970307B6]" . "554041" .