627 search results - page 70 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
173
click to vote
IS
2006
15 years 6 months ago
2006
We propose a micro-benchmark for XML data management to aid engineers in designing improved XML processing engines. This benchmark is inherently different from application-level b...
172
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
189
click to vote
SIGIR
2010
ACM
15 years 4 months ago
2010
ACM
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
241
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
152
click to vote
UAI
2001
15 years 7 months ago
2001
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Dete...