6 search results - page 1 / 2 » Efficient Quantile Retrieval on Multi-dimensional Data |
SEBD
2004
13 years 6 months ago
2004
Abstract. The need to compress data into synopses of summarized information often arises in many application scenarios, where the aim is to retrieve aggregate data efficiently, pos...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
With the explosion in the amount of semi-structured data users access and store, there is a need for complex search tools to retrieve often very heterogeneous data in a simple and ...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
ICDE
1987
IEEE
13 years 8 months ago
1987
IEEE
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...