51 search results - page 1 / 11 » Dynamically Optimizing High-Dimensional Index Structures |
EDBT
2000
ACM
15 years 1 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
111
click to vote
EDBT
1998
ACM
15 years 1 months ago
1998
ACM
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
PODS
2000
ACM
15 years 1 months ago
2000
ACM
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
ICDT
2001
ACM
15 years 2 months ago
2001
ACM
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
178
click to vote
ICDE
1998
IEEE
15 years 11 months ago
1998
IEEE
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...