Detailed Information

Cited 0 time in webofscience Cited 3 time in scopus
Metadata Downloads

Keyword search on relational databases using keyword query interpretation

Authors
Haam D.Lee K.Y.Kim M.H.
Issue Date
Nov-2010
Publisher
IEEE
Citation
Proceeding - 5th International Conference on Computer Sciences and Convergence Information Technology, ICCIT 2010, pp.957 - 961
Journal Title
Proceeding - 5th International Conference on Computer Sciences and Convergence Information Technology, ICCIT 2010
Start Page
957
End Page
961
URI
https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/13614
DOI
10.1109/ICCIT.2010.5711198
Abstract
A user who wants to get information from a relational database needs to know database schema and structured query languages like SQL. The ordinary users are not familiar to those things, so searching information from relational databases is hard to them. Keyword search is a solution of the problem, where a keyword query is a simple and user-friendly search model that can be issued by writing a list of keywords. Because a keyword query can be interpreted variously, a large number of answers are returned. Thus, we need to handle the ambiguity problem. In this paper, we propose a keyword search method on relational databases. This method finds joined tuples as answers, partitions them by interpretations of the query, and ranks those groups of answers. Our ranking method focuses on finding answers derived from interpretations of the query that are similar to the interpretation in minds of ordinary users. An experimental evaluation using real data shows the performance of our ranking method.
Files in This Item
Go to Link
Appears in
Collections
공과대학 > 소프트웨어학부 > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Lee, Ki Yong photo

Lee, Ki Yong
공과대학 (소프트웨어학부)
Read more

Altmetrics

Total Views & Downloads

BROWSE