Keyword Search over Relational Databases

Abstract

A relational database is often operated by means of a structured query language (SQL). When composing SQL-queries one must have an understanding of the SQL syntax to be able to produce a query the database can execute. Additionally, one must be familiar with the attributes and relations in the database to be able to retrieve the data desired. When one wants to search the available data stored in the relational database, these requirements can be discouraging. In this case keyword-based search functionality could improve the accessibility of the data. In recent years, much research on keyword search on relational database has been done, and many prototypes. However, there are still critical problems on the efficiency and effectiveness of Keyword search systems over relational database. In this paper, a system that enables keyword-based search in relational database (KQRD) is presented. We propose Best-first (A*) algorithm and Structured Pivoted Normalization Weighting method to be able to search and retrieve the document from relational database effectively.