[PDF][PDF] Efficient algorithms for masking and finding quasi-identifiers
R Motwani, Y Xu - … of the Conference on Very Large …, 2007 - www-cs-students.stanford.edu
ABSTRACT A quasi-identifier refers to a subset of attributes that can uniquely identify most
tuples in a table. Incautious publication of quasi-identifiers will lead to privacy leakage. In …
tuples in a table. Incautious publication of quasi-identifiers will lead to privacy leakage. In …
Improving query evaluation with approximate functional dependency based decompositions
CM Giannella, MM Dalkilic, DP Groth… - … National Conference on …, 2002 - Springer
We investigate how relational restructuring may be used to improve query performance. Our
approach parallels recent research extending semantic query optimization (SQO), which …
approach parallels recent research extending semantic query optimization (SQO), which …
Towards Better Bounds for Finding Quasi-Identifiers
We revisit the problem of finding small ε-separation keys introduced by Motwani and Xu
(2008). In this problem, the input is a data set consisting of m-dimensional tuples {x1, x2 …
(2008). In this problem, the input is a data set consisting of m-dimensional tuples {x1, x2 …
[图书][B] Approximate functional dependency discovery and one-dimensional selectivity estimation
C Giannella - 2004 - search.proquest.com
Tables are the fundamental data representation in modern database systems and one of the
most fundamental representations in data mining and machine learning. Several …
most fundamental representations in data mining and machine learning. Several …