85 search results - page 9 / 17 » Top-k Query Processing in Uncertain Databases |
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
ICEIS
2002
IEEE
14 years 14 days ago
2002
IEEE
: This work describes the features of the DOMINO (Database fOr MovINg Objects) system, which brings several novelties to the problem of managing moving objects databases. Our robus...
CIDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...