85 search results - page 12 / 17 » Top-k Query Processing in Uncertain Databases |
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
EDBT
2009
ACM
13 years 10 months ago
2009
ACM
Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
EDBT
2011
ACM
12 years 11 months 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...