本文選題：關(guān)系數(shù)據(jù)庫(kù)　切入點(diǎn)：信息檢索　出處：《黑龍江大學(xué)》2013年碩士論文　論文類(lèi)型：學(xué)位論文

【摘要】：關(guān)系數(shù)據(jù)庫(kù)中的關(guān)鍵詞搜索問(wèn)題已經(jīng)逐漸成為信息檢索領(lǐng)域的研究熱點(diǎn)。由于基于關(guān)系數(shù)據(jù)庫(kù)的關(guān)鍵詞搜索技術(shù)不需要用戶(hù)具有任何SQL語(yǔ)法知識(shí)和數(shù)據(jù)庫(kù)模式知識(shí)，只需要輸入關(guān)鍵詞，便可以像互聯(lián)網(wǎng)搜索引擎一樣方便的進(jìn)行關(guān)鍵詞搜素，因此贏(yíng)得了許多用戶(hù)的青睞。本文對(duì)關(guān)系數(shù)據(jù)庫(kù)中的關(guān)鍵詞搜索問(wèn)題做了相關(guān)研究，對(duì)關(guān)鍵詞搜索算法進(jìn)行了改進(jìn)與創(chuàng)新，主要研究成果及貢獻(xiàn)如下： 對(duì)基于模式圖的關(guān)系數(shù)據(jù)庫(kù)關(guān)鍵詞搜索問(wèn)題進(jìn)行了研究，在現(xiàn)有的基于模式圖的關(guān)鍵詞搜索框架內(nèi)，通過(guò)提出新的編碼規(guī)則和迭代算法對(duì)關(guān)鍵詞搜索算法進(jìn)行了改進(jìn)。通過(guò)一系列實(shí)驗(yàn)表明，該算法搜索結(jié)果重復(fù)率較低，在數(shù)據(jù)量較小時(shí)，算法效率較高。 對(duì)基于數(shù)據(jù)圖的關(guān)系數(shù)據(jù)庫(kù)關(guān)鍵詞搜索問(wèn)題進(jìn)行了研究，，提出了一種基于分類(lèi)Steiner樹(shù)和集合連接的關(guān)鍵詞搜索算法，通過(guò)分類(lèi)Steiner樹(shù)降低了搜索結(jié)果的平局率。實(shí)驗(yàn)結(jié)果表明，該算法的優(yōu)勢(shì)在于第一條結(jié)果返回給用戶(hù)的時(shí)間較短，可以大大減少用戶(hù)等待的時(shí)間。在數(shù)據(jù)量適中時(shí)，該算法的效率較高。 將模式圖與數(shù)據(jù)圖相結(jié)合來(lái)解決關(guān)鍵詞搜索問(wèn)題也是本文研究的問(wèn)題之一。本文提出了一套體系結(jié)構(gòu)完整的關(guān)鍵詞搜索系統(tǒng)，并且首次提出了同表查詢(xún)問(wèn)題。實(shí)驗(yàn)結(jié)果表明，基于模式圖與數(shù)據(jù)圖相結(jié)合的關(guān)鍵詞搜索算法在數(shù)據(jù)量較大時(shí)，算法效率較高。
[Abstract]:Keyword search in relational database has gradually become a hot topic in the field of information retrieval. Because the key word search technology based on relational database does not require users to have any knowledge of SQL syntax and database schema. Just input keywords, you can search keywords as easily as the Internet search engine, so it has won the favor of many users. In this paper, we do some research on keyword search in relational database. The keyword search algorithm is improved and innovated. The main research results and contributions are as follows:. In this paper, the key word search problem of relational database based on schema graph is studied. In the existing framework of keyword search based on schema graph, A series of experiments show that the search result repetition rate of the algorithm is low and the efficiency of the algorithm is high when the amount of data is small. In this paper, the key word search problem of relational database based on data graph is studied, and a keyword search algorithm based on classified Steiner tree and set connection is proposed. By classifying Steiner tree, the tie rate of search results is reduced. The experimental results show that, The advantage of the algorithm is that the first result can be returned to the user in a short time, which can greatly reduce the waiting time of the user. When the amount of data is moderate, the efficiency of the algorithm is higher. It is also one of the problems in this paper to solve the keyword search problem by combining schema graph with data graph. In this paper, a complete system of keyword search is proposed, and the query problem of the same table is proposed for the first time. The experimental results show that, The keyword search algorithm based on the combination of schema graph and data graph is more efficient when the amount of data is large.
【學(xué)位授予單位】：黑龍江大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類(lèi)號(hào)】：TP311.13;TP391.3

【參考文獻(xiàn)】

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

1 賴(lài)武定;;XML解析方式對(duì)比與分析[J];電腦編程技巧與維護(hù);2010年08期

2 沈文婷;;數(shù)據(jù)庫(kù)關(guān)鍵字查詢(xún)清理技術(shù)研究[J];電腦知識(shí)與技術(shù);2011年34期

3 邵孟;;全文檢索技術(shù)研究與設(shè)計(jì)[J];福建電腦;2012年01期

4 楊柳;劉鐵英;;XML的比較與研究[J];硅谷;2010年17期

5 蔡宏艷;姚佳麗;王珊;;DETECTOR:基于關(guān)系數(shù)據(jù)庫(kù)通用的在線(xiàn)關(guān)鍵詞查詢(xún)系統(tǒng)[J];計(jì)算機(jī)研究與發(fā)展;2007年01期

6 陶岳;何震瀛;張家琪;;關(guān)系數(shù)據(jù)庫(kù)上基于元組組合的關(guān)鍵字查詢(xún)[J];計(jì)算機(jī)研究與發(fā)展;2011年10期

本文編號(hào)：1600296