首页> 外文期刊>Journal of Zhejiang University. Science >KRBKSS: a keyword relationship based keyword-set search system for peer-to-peer networks
【24h】

KRBKSS: a keyword relationship based keyword-set search system for peer-to-peer networks

机译:KRBKSS:一种用于对等网络的基于关键字关系的关键字集搜索系统

获取原文
获取原文并翻译 | 示例
       

摘要

Distributed inverted index technology is used in many peer-to-peer (P2P) systems to help find rapidly document in which a given word appears. Distributed inverted index by keywords may incur significant bandwidth for executing more complicated search queries such as multiple-attribute queries. In order to reduce query overhead, KSS (keyword-set search) by Gnawali partitions the index by a set of keywords. However, a KSS index is considerably larger than a standard inverted index, since there are more word sets than there are individual words. And the insert overhead and storage overhead are obviously unacceptable for full-text search on a collection of documents even if KSS uses the distance window technology. In this paper, we extract the relationship information between query keywords from websites' queries logs to improve performance of KSS system. Experiments results clearly demonstrated that the improved keyword-set search system based on keywords relationship (KRBKSS) is more efficient than KSS index in insert overhead and storage overhead, and a standard inverted index in terms of communication costs for query.
机译:分布式倒排索引技术已在许多对等(P2P)系统中使用,以帮助快速查找出现给定单词的文档。按关键字分布的反向索引可能会占用大量带宽,以执行更复杂的搜索查询,例如多属性查询。为了减少查询开销,Gnawali的KSS(关键字集搜索)将索引按一组关键字进行分区。但是,KSS索引比标准倒排索引大得多,这是因为单词集多于单个单词。而且,即使KSS使用距离窗口技术,对于在文档集合上进行全文搜索,插入开销和存储开销显然也不可接受。本文从网站的查询日志中提取查询关键词之间的关系信息,以提高KSS系统的性能。实验结果清楚地表明,基于关键字关系的改进关键字集搜索系统(KRBKSS)在插入开销和存储开销方面比KSS索引更有效,并且在查询的通信成本方面比标准倒排索引更有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号