Абстрактный

An Approach for Keyword Searching in Uncertain Graph Data

Nikita B. Zambare, Snehalata S. Dongre

Keyword searching is generally used for retrieving the relevant data from the database. For input query, the related data is retrieved. But it is tedious task to search keyword on uncertain graph. In this paper, the keyword searching technique over uncertain graph is introduced. The Keyword routing method is used to route the keywords to relevant source. In this approach two methods are included. The keyword relationship graph deduces the relationship between keywords and the element mentioning them. The scoring mechanism computes the score of keywords at each level which reduces the ambiguity. The result will include the subtree of the entire graph which includes all keywords of input query having high score and in addition it retrieves the most relevant data . Effective results are derived from employed method.