Scalable top-k keyword search in relational databases

  • Authors:
  • Yanwei Xu;Jihong Guan;Yoshiharu Ishikawa

  • Affiliations:
  • Department of Computer Science and Technology, Tongji University, Shanghai, China;Department of Computer Science and Technology, Tongji University, Shanghai, China;Information Technology Center, Nagoya University, Nagoya-shi, Japan and Graduate School of Information Science, Nagoya University, Nagoya-shi, Japan and National Institute of Informatics, Tokyo, J ...

  • Venue:
  • DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part II
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Keyword search in relational databases has been widely studied in recent years because it does not require users neither to master a certain structured query language nor to know the complex underlying database schemas. There would be a huge number of valid results for a keyword query in a large database. However, only the top 10 or 20 most relevant matches for the keyword query ---according to some definition of "Relevance"--- are generally of interest. In this paper, we propose an efficient method for answering top-k keyword queries over relational databases. The proposed method is built on an existing scheme of keyword search on relational data streams, but incorporates the ranking mechanisms into the query processing methods and makes two improvements to support top-k keyword search in relational databases. Experimental results validate the effectiveness and efficiency of the proposed method.