Browsing in Relational Databases using Keyword Search

Abstract

With the great success of web search engines, keyword search has become the most well-liked search model for users. Information retrieval systems have popularized for searching unstructured data by keywords as a query and results are sorted relevant documents. It has become highly desirable to offer users with flexible ways to query/search information over databases as simple as keyword search like Google search. Thus, there is a need to introduce a keyword searching compatibility in relational database search. We, in this paper introduce the mechanism of scoring results, followed by filtering/ranking the records, and finally browsing the joinable tuples contain all keywords in the query. The proposed system is found to score than the existing systems in the retrieval efficiency in the experimentation.