467 search results - page 45 / 94 » Processing top k queries from samples |
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
DKE
2006
13 years 9 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
DASFAA
2008
IEEE
13 years 11 months ago
2008
IEEE
An important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cos...
VLDB
2009
ACM
14 years 9 months ago
2009
ACM
For a largenumber of data management problems, it would be very useful to be able to obtain a few samples from a data set, and to use the samples to guess the largest (or smallest)...
Publication
This paper presents a framework for building and continuously maintaining spatio-temporal histograms (ST-Histograms, for short). ST-Histograms are used for selectivity estimation o...