|Full text||Click to download.|
|Citation||Submitted for publication, 2005.
The paper introduces the concept of a negative database,in which a set of records DB is represented by its complement set. That is, all the records not in DB are represented, and DB itself is not explicitly stored. After introducing the concept, several results are given regarding the feasibility of such a scheme and its potential for enhancing privacy. It is shown that a database consisting of n, l-bit records can be represented negatively using only O(ln) records. It is also shown that member ship queries for DB can be processed against the negative representation in time no worse than linear in its size and that reconstructing the database DB represented by a negative data base NDB given as input is an NP-hard problem when time complexity is measured as a function of the size of NDB.
Back to publications
Back to previous page