627 search results - page 5 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
PVLDB
2008
14 years 9 months ago
2008
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
157
Voted
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. he ...
EDBT
2009
ACM
15 years 1 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...
SIGMOD
2010
ACM
14 years 4 months ago
2010
ACM
Probabilistic processes appear naturally in various contexts, with applications to Business Processes, XML data management and more. Many models for specifying and querying such p...
186
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Mediator-based data integration systems resolve exploratory queries by joining data elements across sources. In the presence of uncertainties, such multiple expansions can quickly ...