期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2015
卷号：6
期号：5
页码：4496-4500
出版社：TechScience Publications
摘要：Now a days the huge amount of information is maintained, shared and stored on World Wide Web. Every individual need some kind of information which used to be extracted from internet through the various search engines. User expects to get relevant information results according to the query. The information should be relevant as well as valid. To fulfill the user requirements different techniques are used to provide the best and desirable results. A huge amount of research work focusing on the keyword searching, retrieval and query processing has been done in the relational database. In the Web, Linked Data renders data from various sources to be connected and queried. It defines a method of publishing structured and Linked data. Here, the user needs to express requirement in terms of simple keywords. On the basis of given keyword, the problem of finding the relevant sources are defined. Now the main concept of keyword query routing comes which reduces high cost of processing data. In this method with the help of Information Retrieval concept Top-K routing plans are computed using routing graph and which has high frequency count are selected. To overcome the problem of graph expansion the novel indexing method using lucene algorithm is proposed which represents relationship between keywords and data elements. This method reduces the processing time as well as the space required for expansion of graph. With the help of the proposed work the different tradeoffs of existing system are eliminated efficiently and effectively
