【摘要】：當(dāng)今的世界是信息化的世界，隨著互聯(lián)網(wǎng)的廣泛使用，越來(lái)越多的不具備數(shù)據(jù)庫(kù)查詢知識(shí)的人需要訪問(wèn)在線數(shù)據(jù)庫(kù)，由此產(chǎn)生了基于關(guān)鍵字的搜索引擎，它是人們?cè)诨ヂ?lián)網(wǎng)上搜索信息的重要方式。數(shù)據(jù)庫(kù)中的關(guān)鍵字搜索技術(shù)正是在這樣的背景下應(yīng)運(yùn)而生，成為數(shù)據(jù)庫(kù)、信息檢索、互聯(lián)網(wǎng)等領(lǐng)域的學(xué)者共同關(guān)注的研究熱點(diǎn)。 關(guān)系數(shù)據(jù)庫(kù)中的關(guān)鍵字查詢問(wèn)題使得用戶不需要具備數(shù)據(jù)庫(kù)相關(guān)知識(shí)，也不需要掌握復(fù)雜的SQL語(yǔ)法就可以像使用互聯(lián)網(wǎng)搜索引擎一樣使用關(guān)鍵字來(lái)對(duì)數(shù)據(jù)進(jìn)行查詢，因此受到人們的廣泛關(guān)注，許多方法和原型被提出。當(dāng)前流行的關(guān)系數(shù)據(jù)庫(kù)關(guān)鍵字查詢技術(shù)存在較慢的查詢時(shí)間或者不準(zhǔn)確的查詢結(jié)果。針對(duì)這兩個(gè)問(wèn)題，本文提出了一種基于用戶反饋的查詢方法，，該方法從以下兩個(gè)方面進(jìn)行研究： 1.提供給用戶一個(gè)動(dòng)態(tài)表單，使用戶能夠參與查詢過(guò)程。根據(jù)用戶輸入的關(guān)鍵字動(dòng)態(tài)的生成一個(gè)在數(shù)據(jù)庫(kù)中包含關(guān)鍵字的屬性所組成的Form表單提供給用戶，用戶在Form中進(jìn)行選擇并提交，最后，根據(jù)用戶的選擇和數(shù)據(jù)庫(kù)模式圖進(jìn)行連接算法并執(zhí)行SQL獲得最終結(jié)果，實(shí)驗(yàn)證明該方法縮短了查詢時(shí)間并且提高了查詢的準(zhǔn)確性。 2.在查詢結(jié)果中滿足條件的元組連接樹(shù)可能很多，但是用戶通常只對(duì)與關(guān)鍵字最相關(guān)的結(jié)果感興趣。所以需要對(duì)得到的結(jié)果集(元組連接樹(shù))使用排序函數(shù)進(jìn)行排序，把最相關(guān)的結(jié)果排在結(jié)果集的前面返回給用戶。排序函數(shù)是以評(píng)分函數(shù)為基礎(chǔ)的，評(píng)分函數(shù)為每個(gè)元組連接樹(shù)賦予一個(gè)分?jǐn)?shù)，然后，排序函數(shù)根據(jù)這個(gè)分?jǐn)?shù)按照降序?qū)υM連接樹(shù)進(jìn)行排列。本文提出了對(duì)返回結(jié)果集的一種排序策略。以查詢序列與結(jié)果元組樹(shù)之間的相似值作為排序依據(jù)，并分析與重新定義了相關(guān)影響因子的標(biāo)準(zhǔn)化函數(shù)表達(dá)式。通過(guò)在簡(jiǎn)單數(shù)據(jù)庫(kù)上的分析驗(yàn)證了該改進(jìn)是合理的。
[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.
【學(xué)位授予單位】：黑龍江大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2012
【分類號(hào)】：TP311.13

【參考文獻(xiàn)】

相關(guān)期刊論文 前3條

1 王珊;張俊;彭朝暉;戰(zhàn)疆;杜小勇;;基于本體的關(guān)系數(shù)據(jù)庫(kù)語(yǔ)義檢索[J];計(jì)算機(jī)科學(xué)與探索;2007年01期

2 文繼軍,王珊;SEEKER:基于關(guān)鍵詞的關(guān)系數(shù)據(jù)庫(kù)信息檢索[J];軟件學(xué)報(bào);2005年07期

3 彭朝暉;張俊;王珊;;S-CBR:基于數(shù)據(jù)庫(kù)模式展現(xiàn)數(shù)據(jù)庫(kù)關(guān)鍵詞檢索結(jié)果[J];軟件學(xué)報(bào);2008年02期

本文編號(hào)：2213002