arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.13532cs.CRcs.DB
收藏

PriPL-Tree:局部差分隐私下任意分布的精确范围查询

PriPL-Tree: Accurate Range Query for Arbitrary Distribution under Local Differential Privacy

Leixia Wang, Qingqing Ye, Haibo Hu, Xiaofeng Meng

AI总结:

针对局部差分隐私下现有范围查询方法假设数据均匀分布导致估计不准的问题,提出结合层次树与分段线性函数的PriPL-Tree结构,并扩展至多维自适应网格,在真实与合成数据集上有效提升了任意分布范围查询的准确性。

摘要:

在局部差分隐私(LDP)的背景下回答范围查询是在线分析处理(OLAP)中一个被广泛研究的问题。现有的LDP解决方案都假设每个域分区内数据分布是均匀的,但这可能与数据分布多变的现实场景不一致,从而导致估计不准确。为了解决这个问题,我们引入了PriPL-Tree,这是一种新颖的数据结构,它将层次树结构与分段线性(PL)函数相结合,以回答任意分布的范围查询。PriPL-Tree用少量线段精确建模底层数据分布,从而为范围查询提供更准确的结果。此外,我们利用新颖的数据感知自适应网格将其扩展到多维情况。这些网格利用从PriPL-Tree获得的边际分布的洞察来自适应地划分网格,以适应底层分布的密度。我们在真实和合成数据集上的大量实验证明了PriPL-Tree在回答任意数据分布的范围查询方面相对于最先进解决方案的有效性和优越性。

英文摘要:

Answering range queries in the context of Local Differential Privacy (LDP) is a widely studied problem in Online Analytical Processing (OLAP). Existing LDP solutions all assume a uniform data distribution within each domain partition, which may not align with real-world scenarios where data distribution is varied, resulting in inaccurate estimates. To address this problem, we introduce PriPL-Tree, a novel data structure that combines hierarchical tree structures with piecewise linear (PL) functions to answer range queries for arbitrary distributions. PriPL-Tree precisely models the underlying data distribution with a few line segments, leading to more accurate results for range queries. Furthermore, we extend it to multi-dimensional cases with novel data-aware adaptive grids. These grids leverage the insights from marginal distributions obtained through PriPL-Trees to partition the grids adaptively, adapting the density of underlying distributions. Our extensive experiments on both real and synthetic datasets demonstrate the effectiveness and superiority of PriPL-Tree over state-of-the-art solutions in answering range queries across arbitrary data distributions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑