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 ...
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
— The University of California, Berkeley and the University of Liverpool in conjunction with the San Diego Supercomputer Center, are developing a framework for GridBased Digital ...
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Similarity search in complex databases is of utmost interest in a wide range of application domains. Often, complex objects are described by several representations. The combinatio...