2024-03-29T00:01:13Z
https://meral.edu.mm/oai
oai:meral.edu.mm:recid/5401
2022-03-24T23:16:50Z
1582963342780:1596102391527
user-uit
Answering Top-k Keyword Queries on Relational Databases
Myint Myint Thein
Mie Mie Su Thwin
Keyword search in relational databases allows the user to search information without knowing database schema and using structural query language. As results needed by user are assembled from connected tuples of multiple relations, ranking keyword queries are needed to retrieve relevant results. For a given keyword query, we first generate candidate networks and also produce connected tuple trees according to the generated candidate networks by reducing the size of intermediate joining results. We then model the generated connected tuple trees as a document and evaluate score for each document to estimate its relevance. Finally, we retrieve top-k keyword queries by ranking the results. In this paper, we propose a new ranking method based on virtual document. We also propose Top-k CTT algorithm by using the frequency threshold value. The experimental results are shown by comparison of the proposed ranking method and the previous ranking methods on IMDB and DBLP datasets.
2012-07-01
http://hdl.handle.net/20.500.12678/0000005401
https://meral.edu.mm/records/5401