785 search results - page 120 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
181
click to vote
PVLDB
2010
15 years 23 days ago
2010
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...
272
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
Given a region qR and a future timestamp qT, a "range aggregate" query estimates the number of objects expected to appear in qR at time qT. Currently the only methods fo...
241
click to vote
VLDB
2006
ACM
16 years 6 months ago
2006
ACM
For querying structured and semistructured data, data retrieval and document retrieval are two valuable and complementary techniques that have not yet been fully integrated. In thi...
166
click to vote
DKE
2006
15 years 6 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....
178
click to vote
DOLAP
2005
ACM
15 years 8 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...