The Dynamic Disclosure Monitor (D2Mon) is a security mechanism that executes during query processing time to prevent sensitive data from being inferred. A limitation of D2Mon is that it unnecessarily examines the entire history database in computing inferences. In this paper, we present a process that can be used to reduce the number of tuples that must be examined in computing inferences during query processing time. In particular, we show how a priori knowledge of a database dependency can be used to reduce the search space of a relation when applying database dependencies. Using the database dependencies, we develop a process that forms an index table into the database that identifies those tuples that can be used in satisfying database dependencies. We show how this process can be used to extend D2Mon to reduce the number of tuples that must be examined in the history database when computing inferences. We further show that inferences that are computed by D 2Mon using our extension are sound and complete. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Toland, T. S., Farkas, C., & Eastman, C. M. (2005). Dynamic disclosure monitor (D2Mon): An improved query processing solution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3674 LNCS, pp. 124–142). https://doi.org/10.1007/11552338_9
Mendeley helps you to discover research relevant for your work.