Welcome to the InfoSci Platform
Answering Top-k Keyword Queries on Relational Databases

Answering Top-k Keyword Queries on Relational Databases

Myint Myint Thein, Mie Mie Su Thwin
Copyright: © 2012 |Volume: 2 |Issue: 3 |Pages: 22
ISSN: 2155-6377|EISSN: 2155-6385|EISBN13: 9781466612631|DOI: 10.4018/ijirr.2012070103
Cite Article Cite Article

MLA

Thein, Myint Myint, and Mie Mie Su Thwin. "Answering Top-k Keyword Queries on Relational Databases." IJIRR vol.2, no.3 2012: pp.36-57. http://doi.org/10.4018/ijirr.2012070103

APA

Thein, M. M. & Thwin, M. M. (2012). Answering Top-k Keyword Queries on Relational Databases. International Journal of Information Retrieval Research (IJIRR), 2(3), 36-57. http://doi.org/10.4018/ijirr.2012070103

Chicago

Thein, Myint Myint, and Mie Mie Su Thwin. "Answering Top-k Keyword Queries on Relational Databases," International Journal of Information Retrieval Research (IJIRR) 2, no.3: 36-57. http://doi.org/10.4018/ijirr.2012070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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, the authors first generate candidate networks and also produce connected tuple trees according to the generated candidate networks by reducing the size of intermediate joining results. They then model the generated connected tuple trees as a document and evaluate score for each document to estimate its relevance. Finally, the authors retrieve top-k keyword queries by ranking the results. In this paper, the authors propose a new ranking method based on virtual document. They 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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.