基于用户隐私保护的区域多对象聚集问题  

Range-based approach for multi-object convergence problem

作　　者：谈嵘[1] 顾君忠[1] 林欣[1] 陈鹏[1] 

机构地区：[1]华东师范大学信息科学技术学院,上海200241

出　　处：《计算机应用》2011年第9期2389-2394,共6页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60903169);上海市国际科技合作基金资助项目(09510703000;10dz1500103)

摘　　要：针对基于位置服务中的多个查询者聚集的场景,提出一种兼顾用户隐私的基于区域的空间Skyline查询算法——VRSSA,利用Voronoi图等计算几何学方法,解决了基于区域与点之间距离的控制关系的判定,并有效减少了计算的复杂度。同时,针对查询条件的动态改变,提出了两种动态更新算法:被查询对象动态新增算法(DPJA)和被查询对象动态减少算法(DPDA),可有效地减少重复计算的消耗。实验结果证明,提出的算法总体效率较好,具有一定的灵活性。In this paper, the concept of multi-object convergence problem was introduced. While some former query techniques could be used to deal with this problem, they are all point-based and unable to protect location privacy. Hence, a range-based spatial Skyline query algorithm named VRSSA was proposed. It utilized the Voronoi graph and supported the spatial anonymity techniques in Location-based Service （ LBS）. Furthermore, with respect to the changes of query conditions, another two algorithms, Dynamic Point Joining Algorithm （DPJA） and Dynamic Point Deleting Algorithm （DPDA）, to dynamically update the query results were proposed so that heavy re-computation could be avoided. The experimental results show that the approaches could efficiently and effectively solve the problem.

关 键 词：基于位置的服务 上下文感知计算 SKYLINE查询 区域查询 VORONOI图 隐私保护 

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