30 search results - page 2 / 6 » Adaptive Cluster Distance Bounding for High-Dimensional Inde... |
ICDE
2000
IEEE
14 years 6 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
EDBT
2000
ACM
13 years 9 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...
EDBT
1998
ACM
13 years 9 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...
ICDE
2003
IEEE
14 years 6 months ago
2003
IEEE
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
SIGMOD
2001
ACM
14 years 5 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....