493 search results - page 55 / 99 » Consensus answers for queries over probabilistic databases |
260
click to vote
PODS
2009
ACM
16 years 6 months ago
2009
ACM
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...
188
click to vote
AAAI
2006
15 years 7 months ago
2006
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...
175
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Applications involving analysis of data streams have gained significant popularity and importance. Frequency counting, frequent elements and top-k queries form a class of operato...
210
click to vote
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
265
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...