Sciweavers

19 search results - page 1 / 4
» Efficient Query Processing in Arbitrary Subspaces Using Vect...
Sort
View
SSDBM
2006
IEEE
96views Database» more  SSDBM 2006»
13 years 10 months ago
Efficient Query Processing in Arbitrary Subspaces Using Vector Approximations
Hans-Peter Kriegel, Peer Kröger, Matthias Sch...
ICDE
2010
IEEE
178views Database» more  ICDE 2010»
13 years 2 months ago
The Hybrid-Layer Index: A synergic approach to answering top-k queries in arbitrary subspaces
In this paper, we propose the Hybrid-Layer Index (simply, the HL-index) that is designed to answer top-k queries efficiently when the queries are expressed on any arbitrary subset ...
Jun-Seok Heo, Junghoo Cho, Kyu-Young Whang
ICDE
2007
IEEE
218views Database» more  ICDE 2007»
14 years 5 months ago
SKYPEER: Efficient Subspace Skyline Computation over Distributed Data
Skyline query processing has received considerable attention in the recent past. Mainly, the skyline query is used to find a set of non dominated data points in a multidimensional...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
CIKM
2003
Springer
13 years 9 months ago
Dimensionality reduction using magnitude and shape approximations
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 4 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...