Sciweavers

75 search results - page 11 / 15
» Comparing Nested GPSJ Queries in Multidimensional Databases
Sort
View
ITCC
2002
IEEE
13 years 11 months ago
Performance of KDB-Trees with Query-Based Splitting
While the persistent data of many advanced database applications, such as OLAP and scientific studies, are characterized by very high dimensionality, typical queries posed on thes...
Yves Lépouchard, John L. Pfaltz, Ratko Orla...
CVPR
2004
IEEE
14 years 8 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
SSDBM
2009
IEEE
149views Database» more  SSDBM 2009»
14 years 1 months ago
Reverse k-Nearest Neighbor Search Based on Aggregate Point Access Methods
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
Hans-Peter Kriegel, Peer Kröger, Matthias Ren...
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
14 years 1 days ago
Statistical similarity search applied to content-based video copy detection
—Content-based copy detection (CBCD) is one of the emerging multimedia applications for which there is a need of a concerted effort from the database community and the computer ...
Alexis Joly, Olivier Buisson, Carl Frélicot
ICDT
2005
ACM
124views Database» more  ICDT 2005»
13 years 12 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken