k-匿名数据上的聚集查询及其性质  

Aggregate query and its properties over k-anonymous data

作　　者：张君宝[1] 刘国华[1] 王碧颖[1] 王梅[1] 王羽婷[1] 石丹妮[1] 翟红敏[1] 

机构地区：[1]东华大学计算机科学与技术学院,上海201620

出　　处：《计算机工程与科学》2014年第1期176-185,共10页Computer Engineering & Science

基　　金：国家自然科学基金资助项目(61070032;61103046)

摘　　要：k-匿名数据中存在大量的有用信息,如何从k-匿名数据中得到有用的知识是目前亟待解决的问题。OLAP是知识发现的主要手段,聚集查询是OLAP的关键操作。为了解决k-匿名数据聚集查询问题,首先,给出了描述k-匿名数据的数据模型。其次,将聚集查询分为两个阶段,在第一阶段,给出k-匿名数据满足的性质和独立属性集的概念,利用k-匿名的性质和独立属性集给出求解满足查询约束的值和概率集合的算法,并将该集合作为第二阶段的输入。在第二阶段,给出聚集查询的语义。为了满足用户不同的查询需求,给出WITH子句约束及不同WITH子句约束的语义,作为聚集查询的第一阶段的补充。最后,讨论了聚集查询的性质,并用实验验证了查询的有效性。A great deal of information exists in k-anonymous data. How to get useful information from k-anonymous data is an urgent pending problem. OLAP （On-Line Analytical Processing） is the main approach of knowledge discovery, and the aggregate query is the key operation of OLAP. In order to solve the problem of aggregate query over k-anonymous data, firstly, the definition of data model de- scribing k-anonymous data is given. Secondly, the aggregate query is separated into two phases. On the first phase, the properties of k-anonymous data satisfication and the notion of Independent Attribute Set is presented. Using these properties and the Independent Attribute Set, an algorithm is given to corn pute the set of value and its probability that satisfy the query constraint, and then take the set as the in- put of second phase. On the second phase, the semantics of the aggregate query over k-anonymous data are defined. In order to meet user＇s different query, the definition and the semantic of WITH clause constraint is given as a supplement to first phase. At last, properties of the aggregate query are shown and an experiment is done to prove the validity of our method.

关 键 词：数据共享 OLAP 隐私保护 K-匿名 聚集查询 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]