Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memo...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
A musical piece typically has a repetitive structure. Analysis of this structure will be useful for music segmentation, indexing and thumbnailing. This paper presents an algorithm...