欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
K-匿名表的更新问题是视图安全领域的一个新问题。当数据库基本表发生更新操作时,K-匿名表应与其保持一致性,做出相应更新。现有方法集中在重新计算K-匿名表,会造成很大的系统开销。为了减少更新时间,首先,提出了多维桶的概念及其相关操作。然后,给出了基本表中发生变化的元组与多维桶的对应关系,并将这种变化关系映射为K-匿名表的增量更新操作。在此基础上,提出了基于多维桶的K-匿名表增量更新算法。该算法避免了K-匿名表因基本表微小改动就需要重新计算的不足,提高了K-匿名表的实际应用性能。
英文摘要：
It is difficult for the existing k-dominate algorithms to ensure the diversity of the results, as a result, the selective space is restricted. How to find out the all k-dominate attributes is a new problem in the domain of the k-dominant skyline. Focusing on this, a new concept, called multi-k-dominant skyline, is proposed. And the properties of multi-k-dominant skyline is proved. Then two different new algorithms for finding the multi-k-dominant skyline are presented. The validity and correctness of the algorithms are proved.
同期刊论文项目
同项目期刊论文
期刊信息
位置：