• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Workshop on Databases, Information Systems, and Peer-to-Peer Computing(DBISP2P 2003); 20030907-20030908; Berlin; DE >Content-Based Overlay Networks for XML Peers Based on Multi-level Bloom Filters
【24h】

Content-Based Overlay Networks for XML Peers Based on Multi-level Bloom Filters

机译：基于多级Bloom筛选器的XML对等基于内容的覆盖网络

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Peer-to-peer systems are gaining popularity as a means to effectively share huge, massively distributed data collections. In this paper, we consider XML peers, that is, peers that store XML documents. We show how an extension of traditional Bloom filters, called multi-level Bloom filters, can be used to route path queries in such a system. In addition, we propose building content-based overlay networks by linking together peers with similar content. The similarity of the content (i.e., the local documents) of two peers is defined based on the similarity of their filters. Our experimental results show that overlay networks built based on filter similarity are very effective in retrieving a large number of relevant documents, since peers with similar content tend to be clustered together.
机译：对等系统作为一种有效共享庞大，大规模分布的数据集合的手段而越来越受欢迎。在本文中，我们考虑XML对等点，即存储XML文档的对等点。我们展示了如何将传统Bloom过滤器的扩展（称为多级Bloom过滤器）用于在这样的系统中路由路径查询。此外，我们建议通过将具有相似内容的对等体链接在一起来构建基于内容的覆盖网络。基于两个对等方的过滤器的相似性来定义两个对等方的内容（即本地文档）的相似性。我们的实验结果表明，基于过滤器相似性构建的覆盖网络在检索大量相关文档方面非常有效，因为内容相似的对等体往往会聚在一起。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号