Sciweavers

232 search results - page 1 / 47
» Fast High-Dimensional Data Search in Incomplete Databases
Sort
View
VLDB
1998
ACM
87views Database» more  VLDB 1998»
13 years 9 months ago
Fast High-Dimensional Data Search in Incomplete Databases
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan
ISM
2006
IEEE
174views Multimedia» more  ISM 2006»
13 years 11 months ago
Fast Similarity Search for High-Dimensional Dataset
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
Quan Wang, Suya You
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 6 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
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...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
14 years 5 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 5 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis