Keyword Query Search Using KERG

Searching is a spontaneous method for searching linked data sources on the web. We suggest to route s only to related sources to reduce the cost of searching queries over all sources. The new method is proposed for computing top-k routing plans. We employ a -element relationship graph (KERG) that shows relationships between s and elements. A multilevel scoring mechanism is proposed for calculating the relevance of routing plans which depends on scores at the level of s, data elements, element sets and subgraphs that connect all this elements.