Efficient Keyword Search in Relational Databases

A user who wants to get knowledge from a relational database that needs to know about structured query languages and database schema. Mostly users are not know to those things, so searching knowledge from relational databases is difficult to them. Where a keyword query input is a simple search model that can be issued by writing a list of keywords values, keyword search that place provide a solution of the problem. Because a keyword input query can be interpreted variously, a large number of outputs are returned. And indexing helps to easily retrieved answers and with the help of indexing we measure the performance of the CPU, execution time and Disk memory consumed.