Keyword Search over Relational Databases

Abstract

A relational database is often operated bymeans of a structured query language (SQL).When composing SQL-queries one must have anunderstanding of the SQL syntax to be able toproduce a query the database can execute.Additionally, one must be familiar with theattributes and relations in the database to beable to retrieve the data desired. When onewants to search the available data stored in therelational database, these requirements can bediscouraging. In this case keyword-based searchfunctionality could improve the accessibility ofthe data. In recent years, much research onkeyword search on relational database has beendone, and many prototypes. However, there arestill critical problems on the efficiency andeffectiveness of Keyword search systems overrelational database. In this paper, a system thatenables keyword-based search in relationaldatabase (KQRD) is presented. We proposeBest-first (A*) algorithm and Structured PivotedNormalization Weighting method to be able tosearch and retrieve the document from relationaldatabase effectively