493 search results - page 24 / 99 » Consensus answers for queries over probabilistic databases |
EDBT
2008
ACM
14 years 11 months ago
2008
ACM
In this paper we consider the on-line max and min query auditing problem: given a private association between fields in a data set, a sequence of max and min queries that have alr...
WWW
2010
ACM
14 years 4 months ago
2010
ACM
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
EDBT
2010
ACM
14 years 5 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
SIGMOD
2010
ACM
14 years 3 months ago
2010
ACM
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
SIGMOD
2001
ACM
14 years 11 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...