Computational complexity of auditing finite attributes in statistical databases

  • Authors:

  • Peter Jonsson;Andrei Krokhin

  • Affiliations:

  • Department of Computer and Information Science, Linköpings Universitet, SE-581 83 Linköping, Sweden;Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham DH1 3LE, UK

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the computational complexity of auditing finite attributes in databases allowing statistical queries. Given a database that supports statistical queries, the auditing problem is to check whether an attribute can be completely determined or not from a given set of statistical information. Some restricted cases of this problem have been investigated earlier, e.g. the complexity of statistical sum queries is known by the work of Kleinberg et al. (J. Comput. System Sci. 66 (2003) 244-253). We characterize all classes of statistical queries such that the auditing problem is polynomial-time solvable. We also prove that the problem is coNP-complete in all other cases under a plausible conjecture on the complexity of constraint satisfaction problems (CSP). The characterization is based on the complexity of certain CSP problems; the exact complexity for such problems is known in many cases. This result is obtained by exploiting connections between auditing and constraint satisfaction, and using certain algebraic techniques. We also study a generalization of the auditing problem where one asks if a set of statistical information imply that an attribute is restricted to K or less different values. We characterize all classes of polynomial-time solvable problems in this case, too.