An empirical performance for adaptive keyword query searching in co-related databases

Keyword Search is an alternate way of dealing with traditional SQL querying in relational database for larger databases. In traditional database search the underlying schema and instances must be known. One of the challenges in keyword search is retrieving the relevant answer according to user´s requirement. The other challenge is to rank the answer. Recent work shows that answer for keyword query reside in single database. This paper proposes an efficient keyword search algorithm in co-related databases along with DeINIX (DEnsity INverted IndeX) an inverted index technique, which will take fewer amounts of memory space and top-notch(top-10) answering. Our experimental result shows that this method answers queries more precisely, takes lesser time and memory space to retrieve a quality answer.