A SURVEY ON KEYWORD QUERY ROUTING IN DATABASES

The web is a no longer operation it is only provides a link for searching the web document based on the keyword. The query can be formed from keywords which are used to retrieve the document. It is difficult for the typical web users to exploit this web data by means of structured queries using languages like SQL or SPARQL. In database research, most of the approaches use only the single source solutions. The main issue here is computing the most relevant combinations of sources. To route keywords only to relevant sources, a novel method is proposed for computing top-k routing plans based on their keyword query. The keyword-element relationship summary is used to represents the relationships between keywords and the data elements. Multilevel scoring mechanism is proposed for computing the relevance of routing plans based on scores at the level of keywords and data elements. It has no knowledge about the query language and it as opposed to structured queries. So the schema or the underlying data is needed.