493 search results - page 35 / 99 » Consensus answers for queries over probabilistic databases |
EDBTW
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite dom...
143
click to vote
ICDE
2011
IEEE
14 years 2 months ago
2011
IEEE
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
SIGMOD
1998
ACM
15 years 3 months ago
1998
ACM
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
181
Voted
ICDE
2006
IEEE
16 years 14 days ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
ICDE
2007
IEEE
15 years 5 months ago
2007
IEEE
Privacy is a serious concern when microdata need to be released for ad hoc analyses. The privacy goals of existing privacy protection approaches (e.g., -anonymity and -diversity) ...