Keyword Query Routing using Relationship Graph

searching is an best method for searching linked data sources on the web. We, propose to route s only to relevant sources to reduce the processing cost of queries search over all sources of web. We propose a best method for computing top- routing plans based on their potentials to contain results for a given query. We find a -element relationship summary that shows a relationships between s and the data elements showing them. A multilevel scoring mechanism is proposed for computing the relevance of routing plans based on scores at the level of s, data elements, element sets, and subgraphs that connect these elements. Further, we show routing greatly helps to improve the performance of search, without compromising its result quality.