摘要
基于关系数据库的关键词查找技术像使用搜索引擎一样获取数据库中相关的数据。针对RDBMS上具体书目索引数据库的关键词查找高效性问题,提出了对返回结果集的一种排序策略。以查询序列与结果元组树之间的相似值作为排序依据,参照传统信息检索系统上关键词查找结果集排序的相似值计算公式,提出数据库上查询序列与结果元组树之间的相似值公式,并分析与重新定义了相关影响因子的标准化函数表达式。通过在简单数据库上的分析验证了该改进是合理的。关键词:信息检索;关系数据库;关键词;权重;相似值;因子;
Keyword search techniques based on the relational databases are similar with getting relative data from databases by search engines. A ranking strategy of result sets is presented aimed at the efficiency problem in keyword search that based on book index data- bases. All query answers＇ ranking depended on the similarity value between query sequence and result tuple trees. According to similarity functions that are produced by result sets on traditional information retrieval systems, different similarity functions are given based on relational databases. In addition, related influence factors are analyzed and redefined. And the improvement is proved reasonable by analyzing and verifying on simple databases.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第10期2566-2569,共4页
Computer Engineering and Design
基金
湖南省教育厅科研基金项目(05C671)
中南大学重点资助创新基金项目(ZB018)
关键词
信息检索
关系数据库
关键词
权重
相似值
因子
元组树
informational retrieval
relational databases
keyword
weight
similarity
factor
tupletree
