785 search results - page 6 / 157 » Efficient Processing of Top-k Queries 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...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
VLDB
2004
ACM
14 years 27 days ago
2004
ACM
Query processing in database systems has developed beyond mere exact matching of attribute values. Scoring database objects and retrieving only the top k matches or Pareto-optimal...
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
2008
ACM
14 years 7 months ago
2008
ACM
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...