![]() ![]() ![]() |
![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
Return to Research Papers In an on-line statistical database, the query system should leave unanswered queries asking for sums that could lead to the disclosure of confidential data. To check that, every sum query and previously answered sum queries should be audited. We show that, under a suitable query-overlap restriction, an auditing procedure can be efficiently worked out using flow-network computation. Lecture Notes in Computer Science Publisher: Springer-Verlag Heidelberg ISSN: 0302-9743 Subject: Computer Science Volume 2572 / 2003 Title: : Database Theory - ICDT 2003: 9th International Conference Siena, Italy, January 8-10, 2003. Proceedings Editors: D. Calvanese, M. Lenzerini, R. Motwani (Eds.) : Chapter: pp. 126 - 142 }, ![]() ©2005 Association for Computing Machinery |