首页> 外文会议>ACM SIGMOD international conference on management of data >Load-Balanced Query Dissemination in Privacy-Aware Online Communities
【24h】

Load-Balanced Query Dissemination in Privacy-Aware Online Communities

机译:在隐私感知在线社区中的负载平衡查询传播

获取原文

摘要

We propose a novel privacy-preserving distributed infrastructure in which data resides only with the publishers owning it. The infrastructure disseminates user queries to publishers, who answer them at their own discretion. The infrastructure enforces a publisher k-anonymity guarantee, which prevents leakage of information about which publishers are capable of answering a certain query. Given the virtual nature of the global data collection, we study the challenging problem of efficiently locating publishers in the community that contain data items matching a specified query. We propose a distributed index structure, UQDT, that is organized as a union of Query Dissemination Trees (QDTs), and realized on an overlay (i.e., logical) network infrastructure. Each QDT has data publishers as its leaf nodes, and overlay network nodes as its internal nodes; each internal node routes queries to publishers, based on a summary of the data advertised by publishers in its subtrees. We experimentally evaluate design tradeoffs, and demonstrate that UQDT can maximize throughput by preventing any overlay network node from becoming a bottleneck.
机译:我们提出了一种新的隐私保留分布式基础架构,其中数据仅与拥有的发布者一起驻留。基础设施将用户查询传播给出版商,他们以自己的自由裁量权回答它们。基础架构强制开发出版商K-Anonymity保证,这可以防止有关哪个发布者能够回答某个查询的信息泄漏。鉴于全球数据收集的虚拟性质,我们研究了有效地定位在包含匹配指定查询的数据项的社区中的充分列出的问题。我们提出了一种分布式索引结构,UQDT,该结构被组织为查询传播树(QDTS)的联盟,并在覆盖(即逻辑)网络基础架构上实现。每个QDT都具有数据发布者作为其叶节点,并将网络节点覆盖为内部节点;基于由其子树中发布者通告的数据的摘要,每个内部节点向发布者进行查询。我们通过实验评估设计权衡,并证明UQDT可以通过防止任何覆盖网络节点成为瓶颈来最大限度地提高吞吐量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号