...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Knowledge and information systems >A decentralized search engine for dynamic Web communities
【24h】

A decentralized search engine for dynamic Web communities

机译：动态Web社区的分散式搜索引擎

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

摘要

Currently, most Web search engines perform search on corpus comprising nearly entire content of the Web. The same centralized search service can be performed on a single site as well. Nonetheless, there is little research on community-wide search. This paper presents a peer-to-peer search engine ComSearch. ComSearch is designed to provide small- and middle-scale online communities-the ability to perform text search within the community. Communities are formed in a self-organizing style. P2P IR system may suffer unnecessary internal traffic in answering a multi-term query. In this paper, we propose several techniques to optimize the multi-term query process. The simulation results show that our proposed algorithms have good scalability. Compared with baseline approach, our improved algorithm can reduce the communication cost by about two orders of magnitude in the best case. We also deploy the system in a small-scale network and conduct a series of experiments to estimate the actual query response time as well as to investigate the data movement effect caused by node joining. Experimental results show that multiple data movements are quite common during network expansion. However, the percentage of multiple data movements decreases when a network is getting stable after the initial frequent joining activities. This provides possibilities for improvement on P2P data movement management.
机译：当前，大多数Web搜索引擎都对几乎包含Web整个内容的语料库进行搜索。同样的集中式搜索服务也可以在单个站点上执行。但是，关于社区范围搜索的研究很少。本文介绍了对等搜索引擎ComSearch。 ComSearch旨在为中小型在线社区提供在社区内执行文本搜索的功能。社区以自组织的形式形成。 P2P IR系统可能会在回答长期查询时遭受不必要的内部流量。在本文中，我们提出了几种优化多项查询过程的技术。仿真结果表明，本文提出的算法具有良好的可扩展性。与基线方法相比，我们的改进算法在最佳情况下可以将通信成本降低大约两个数量级。我们还将系统部署在小型网络中，并进行了一系列实验，以估计实际的查询响应时间，并调查由节点加入引起的数据移动效果。实验结果表明，在网络扩展过程中，多种数据移动非常普遍。但是，当网络在最初的频繁加入活动之后变得稳定时，多个数据移动的百分比会降低。这为改进P2P数据移动管理提供了可能性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号