基于用户反馈的关系数据库关键词搜索技术研究
发布时间：2018-08-30 11:57
【摘要】：当今的世界是信息化的世界，随着互联网的广泛使用，越来越多的不具备数据库查询知识的人需要访问在线数据库，由此产生了基于关键字的搜索引擎，它是人们在互联网上搜索信息的重要方式。数据库中的关键字搜索技术正是在这样的背景下应运而生，成为数据库、信息检索、互联网等领域的学者共同关注的研究热点。 关系数据库中的关键字查询问题使得用户不需要具备数据库相关知识，也不需要掌握复杂的SQL语法就可以像使用互联网搜索引擎一样使用关键字来对数据进行查询，因此受到人们的广泛关注，许多方法和原型被提出。当前流行的关系数据库关键字查询技术存在较慢的查询时间或者不准确的查询结果。针对这两个问题，本文提出了一种基于用户反馈的查询方法，，该方法从以下两个方面进行研究： 1.提供给用户一个动态表单，使用户能够参与查询过程。根据用户输入的关键字动态的生成一个在数据库中包含关键字的属性所组成的Form表单提供给用户，用户在Form中进行选择并提交，最后，根据用户的选择和数据库模式图进行连接算法并执行SQL获得最终结果，实验证明该方法缩短了查询时间并且提高了查询的准确性。 2.在查询结果中满足条件的元组连接树可能很多，但是用户通常只对与关键字最相关的结果感兴趣。所以需要对得到的结果集(元组连接树)使用排序函数进行排序，把最相关的结果排在结果集的前面返回给用户。排序函数是以评分函数为基础的，评分函数为每个元组连接树赋予一个分数，然后，排序函数根据这个分数按照降序对元组连接树进行排列。本文提出了对返回结果集的一种排序策略。以查询序列与结果元组树之间的相似值作为排序依据，并分析与重新定义了相关影响因子的标准化函数表达式。通过在简单数据库上的分析验证了该改进是合理的。
[Abstract]:Today's world is the world of information, with the wide use of the Internet, more and more people who do not have knowledge of database query need to access online databases, resulting in a keyword-based search engine. It is an important way for people to search for information on the Internet. Keyword search technology in database emerges as the times require under this background and has become a common research hotspot in the fields of database, information retrieval, Internet and so on. The key query problem in relational database makes users do not need to have knowledge of database, and do not need to master complex SQL syntax to use keywords to query data just like Internet search engine. As a result, many methods and prototypes have been proposed. At present, the popular key query technology of relational database has slow query time or inaccurate query results. Aiming at these two problems, this paper proposes a query method based on user feedback, which is studied from the following two aspects: 1. Provides the user with a dynamic form to enable the user to participate in the query process. Dynamically generate a Form form composed of attributes that contain keywords in the database according to the keywords entered by the user. The user selects and submits the form in the Form. According to the user's choice and database schema diagram, the algorithm is connected and SQL is executed to obtain the final result. The experiment shows that the method shortens the query time and improves the accuracy of query. 2. There may be many tuple join trees that satisfy the criteria in query results, but users are usually only interested in the results that are most relevant to the keyword. So it is necessary to sort the result set (tuple join tree) using sort function and return the most relevant result to the user before the result set. The sorting function is based on the scoring function, which assigns a score to each tuple join tree, and then sorts the tuple join tree in descending order according to the score. In this paper, a sorting strategy for returning result sets is proposed. Based on the similarity between the query sequence and the result tuple tree, the normalized function expressions of the related factors are analyzed and redefined. The analysis on the simple database proves that the improvement is reasonable.
【学位授予单位】：黑龙江大学
【学位级别】：硕士
【学位授予年份】：2012
【分类号】：TP311.13
本文编号：2213002
[Abstract]:Today's world is the world of information, with the wide use of the Internet, more and more people who do not have knowledge of database query need to access online databases, resulting in a keyword-based search engine. It is an important way for people to search for information on the Internet. Keyword search technology in database emerges as the times require under this background and has become a common research hotspot in the fields of database, information retrieval, Internet and so on. The key query problem in relational database makes users do not need to have knowledge of database, and do not need to master complex SQL syntax to use keywords to query data just like Internet search engine. As a result, many methods and prototypes have been proposed. At present, the popular key query technology of relational database has slow query time or inaccurate query results. Aiming at these two problems, this paper proposes a query method based on user feedback, which is studied from the following two aspects: 1. Provides the user with a dynamic form to enable the user to participate in the query process. Dynamically generate a Form form composed of attributes that contain keywords in the database according to the keywords entered by the user. The user selects and submits the form in the Form. According to the user's choice and database schema diagram, the algorithm is connected and SQL is executed to obtain the final result. The experiment shows that the method shortens the query time and improves the accuracy of query. 2. There may be many tuple join trees that satisfy the criteria in query results, but users are usually only interested in the results that are most relevant to the keyword. So it is necessary to sort the result set (tuple join tree) using sort function and return the most relevant result to the user before the result set. The sorting function is based on the scoring function, which assigns a score to each tuple join tree, and then sorts the tuple join tree in descending order according to the score. In this paper, a sorting strategy for returning result sets is proposed. Based on the similarity between the query sequence and the result tuple tree, the normalized function expressions of the related factors are analyzed and redefined. The analysis on the simple database proves that the improvement is reasonable.
【学位授予单位】：黑龙江大学
【学位级别】：硕士
【学位授予年份】：2012
【分类号】：TP311.13
【参考文献】
相关期刊论文 前3条
1 王珊;张俊;彭朝晖;战疆;杜小勇;;基于本体的关系数据库语义检索[J];计算机科学与探索;2007年01期
2 文继军,王珊;SEEKER:基于关键词的关系数据库信息检索[J];软件学报;2005年07期
3 彭朝晖;张俊;王珊;;S-CBR:基于数据库模式展现数据库关键词检索结果[J];软件学报;2008年02期
本文编号：2213002
本文链接：https://www.wllwen.com/kejilunwen/sousuoyinqinglunwen/2213002.html
