493 search results - page 61 / 99 » Consensus answers for queries over probabilistic databases |
275
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
138
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
298
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
278
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with t...
186
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Prior work in differential privacy has produced techniques for answering aggregate queries over sensitive data in a privacypreserving way. These techniques achieve privacy by addi...