785 search results - page 93 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
226
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Data streaming systems are becoming essential for monitoring applications such as financial analysis and network intrusion detection. These systems often have to process many simi...
256
Voted
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
147
Voted
SDM
2010
SIAM
15 years 6 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
236
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
135
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...