首页> 外文会议>International Workshop on Database and Expert Systems Applications >Effective Keyword Search over Relational Databases Considering keywords proximity and keywords N-grams
【24h】

Effective Keyword Search over Relational Databases Considering keywords proximity and keywords N-grams

机译:考虑关键字接近和关键字n-grams的关系数据库有效关键字搜索

获取原文

摘要

The current amount of text data in relational databases is massive and is growing fast. This increases the importance and need for non-technical users to be able to search for such information using a simple keyword search. Researchers have studied and addressed some of the issues with the efficiency and effectiveness of answering keyword queries in relational databases. In this paper we have summarized different factors affecting the effectiveness of the keyword search in relational databases which were studied in the early works. We have also identified two other important factors, namely keywords proximity and keywords N-grams that can further improve the search effectiveness when incorporated in the existing state-of-the-art information retrieval relevance ranking strategies for relational databases. Our experiments show that applying these two factors to the current ranking functions will improve the effectiveness of keyword search in relational databases.
机译:关系数据库中的当前文本数据量是大规模的,快速增长。这增加了非技术用户能够使用简单的关键字搜索搜索此类信息的重要性和需求。研究人员研究过一些问题,并解决了关系数据库中的关键字查询的效率和有效性。在本文中,我们总结了影响在早期作品中研究的关系数据库中关键字搜索的有效性的不同因素。我们还确定了另外两个重要因素,即关键字接近和关键词,当结合在现有的最先进的信息检索相关性排序策略中,可以进一步提高搜索效果。我们的实验表明,将这两个因素应用于当前的排名功能,将提高关键词搜索在关系数据库中的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号