Figure 1. General Workflow of Algorithm-.Data Conflict Resolution among Same Entities in Web of Data

<p>The Page Rank algorithm which is widely used in most search engines such as Google could<br> be easily used to rank linked data. By starting from a point and random surfing, this algorithm<br> evaluates the probability of finding any given page. The algorithm assumes a link between a page i<br> to a page j demonstrates the importance of page j. In addition, the importance of page j is associated<br> to the importance of page i itself and inversely proportional to the number of pages i point to. To<br> adapt this algorithm to web of data, any page considered as a dataset and links between pages<br> considered as links between datasets.</p>