Linked Open Data Search Engine
Hiteshwar Kumar Azad, Akshay Deepak, Kumar Abhishek · 2016
Linked data indicate a manner of publishing and interlinking structured data on the web. The basic hypothesis behind the concept of linked data is that the value and importance of data increases more when it is interlinked with different data sources. This interlinked web of data is termed as the Linked data. Searching data and providing the most relevant information in linked data is a big challenge. A search engine's utility depends upon the relevance of the search results it returns. Traditional search engines are made to search data on the World Wide Web, where the data are not interlinked. On the other hand, Linked Data based search engine will have to operate over an interlinked web of data. Yet another challenge is to rank the search results. The searched term or phrase can be present in numerous web pages. The usefulness of information present in some pages may be greater than others. So in order to provide the most relevant data, Search engines need to apply various ranking methods on their search results. However the methodology used for ranking data cannot be used in the same manner as it is used in traditional search engines, because the probability of a random user to visit a particular link is not equally likely. In this manuscript a methodology for ranking linked data has been proposed. Also, we have categorized the search into two basic types as Forward search and Backward search. The aim of this bifurcation is to minimize search delays and to provide the end user the data that he or she is most probably looking for.