期刊文献+

面向稠密区域的本地化差分隐私自适应空间分解

Adaptive spatial decomposition based on localized differential privacy for dense regions
在线阅读 下载PDF
导出
摘要 针对常规均匀网格法和自适应网格分解法处理空间数据时存在查询精度与查询效率较低的问题,提出一种基于本地化差分隐私的自适应空间分解算法(LDP-ASDT)。通过分组策略对空间进行分层分解,划分出稠密与稀疏区域;利用四分树通过设定合适阈值,对稠密区域进一步自适应分解;利用一元编码对划分结果进行扰动实现隐私保护。理论分析证明该算法满足本地化差分隐私。在三个真实数据集上进行实验,结果表明,查询精度与运行效率优于GT-R、PrivAG、KDRQ、ASDQT算法,在稠密区域查询精度比ASDQT算法提升一倍,运行速率提升17%。 To address the issues of low query accuracy and efficiency in processing spatial data using conventional uniform grid methods and adaptive grid decomposition methods,this paper developed an adaptive spatial decomposition algorithm based on local differential privacy(LDP-ASDT).LDP-ASDT performed spatial decomposition hierarchically using a grouping strategy to separate dense and sparse regions.For dense regions,it further adaptively decomposed them by setting appropriate thresholds using a quadtree.It perturbed the decomposition results using one-dimensional coding to achieve privacy protection.Theoretical analysis demonstrates that this algorithm satisfies localized differential privacy.Experiments conducted on three real datasets show that the query accuracy and operational efficiency of this algorithm are superior to those of GT-R,PrivAG,KDRQ,and ASDQT algorithms.Specifically,compared to the ASDQT algorithm,LDP-ASDT algorithm doubles the query accuracy and increases the operational rate by 17%in dense regions.
作者 季博 李晓会 贾旭 Ji Bo;Li Xiaohui;Jia Xu(School of Electronics&Information Engineering,Liaoning University of Technology,Jinzhou Liaoning 121000,China)
出处 《计算机应用研究》 北大核心 2025年第8期2518-2524,共7页 Application Research of Computers
基金 国家自然科学基金青年基金资助项目(61802161) 辽宁省应用基础研究计划资助项目(2022JH2/101300278,2022JH2/101300279) 2024年辽宁省属本科高校基本科研业务费专项资金资助项目(LJZZ212410154025,LJZZ222410154004) 辽宁工业大学研究生教育改革创新项目(YJG2023013)。
关键词 本地化差分隐私 自适应空间分解 自适应网格划分 随机响应 空间范围查询 local differential privacy adaptive spatial decomposition adaptive grid decomposition randomized response spatial range query
  • 相关文献

参考文献5

二级参考文献25

  • 1桂林.R-tree空间索引方法的优化研究[J].武汉理工大学学报,2009,31(2):97-99. 被引量:3
  • 2张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量:95
  • 3[1]V Gaede , O Gunther.Multidimentional Access Methods[J].Computing Surveys,1998,30(2):170- 231.
  • 4[2]J P Peloux,et al.Evaluation of Spatial Indices Implemented with the DBMS O2[EB/OL].Gemo Report Number 69,Ingenierie des Systemes d'Information,1995,http://osage.inria.fr/verso/Gemo/PUBLI/all-byyear.php,2001- 06.
  • 5[3]Hoel E G,et al.A Qualitative Comparison Study of Data Structures for Large Segment Databases[C].Proc.ACM SIGMOD Int.Conf.on Management of Data,1992.205- 214.
  • 6[4]Guttman A.R-trees: A Dynamic Index Structure for Spatial Searching[C].Proc.ACM SIGMOD International Conference on Management of Data,1984.47- 57.
  • 7[5]Beckman N H,P Krigel,R Schneider,et al.The R*-tree:An Efficient and Robust Access Method for Points and Rectangles[C].Proc.ACM SIGMOD International Conference on Management of Data,1990.322- 331.
  • 8[6]Smith T R,P Gao.Experimental Performance Evaluations on Spatial Access Methods[C].Proc.4th Int.Symp.on Spatial Data Handling,Zurich,1990.991- 1002.
  • 9[7]Hutflesz A,H W Six,P Widmayer.Globally Order Preserving Multidimensional Linear Hashing[C].Proc.4th IEEE Int.Conf.on Data Eng.,1988.572- 579.
  • 10[8]Bhm,Hans-Peter Kriegel.Dynamically Optimizing High-Dimensional Index Structures,Advances in Database Technology-EDBT 2000[C].7th International Conference on Extending Database Technology,Konstanz,Germany,Proceedings,2000.36- 50.

共引文献107

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部