15 search results - page 1 / 3 » Computational complexity of auditing finite attributes in st... |
JCSS
2008
13 years 4 months ago
2008
PODS
2000
ACM
13 years 9 months ago
2000
ACM
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
ALMOB
2006
13 years 4 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
VLDB
2007
ACM
13 years 10 months ago
2007
ACM
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...