Referenced Items are not available for this document.
Studies statistical database problems for 2D tables whose regular cells, row sums, column sums and table sums may be suppressed. Using graph-theoretical techniques, we give optimal or efficient algorithms for the query system problem, the adversary problem and the minimum complementary suppression problem. These three problems are considered for a variety of data security requirements such as those of protecting linear invariants, analytic invariants, k rows (or columns) as a whole, and a table as a whole
Published in:
Scientific and Statistical Database Management, 1997. Proceedings., Ninth International Conference on
Date of Conference: 11-13 Aug 1997
- Page(s):
- 155 - 164
- Meeting Date :
- 11 Aug 1997-13 Aug 1997
- Print ISBN:
- 0-8186-7952-2
- INSPEC Accession Number:
- 5698471
- Conference Location :
- Olympia, WA
- Digital Object Identifier :
- 10.1109/SSDM.1997.621180
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
