467 search results - page 9 / 94 » Processing top k queries from samples |
JACM
2012
11 years 11 months ago
2012
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
SIGIR
2002
ACM
13 years 9 months ago
2002
ACM
In this paper we present an evaluation of techniques that are designed to encourage web searchers to interact more with the results of a web search. Two specific techniques are ex...
DEXA
2009
Springer
14 years 3 months ago
2009
Springer
Dimension hierarchies represent a substantial part of the data warehouse model. Indeed they allow decision makers to examine data at different levels of detail with On-Line Analyt...
EDBT
2010
ACM
13 years 11 months ago
2010
ACM
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
EDBT
2011
ACM
13 years 24 days ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...