Abstract (EN):
There are many information retrieval tasks over the Web, which cannot be attended with a simple keyword-based lookup search. Such an important exploratory search problem is the comparison of two Web resources. To manually compare two data resources by looking for information from one Web page to another without any software support is inefficient and time-consuming. This paper discusses a solution to automatize the comparison of two data resources present in a RDF graph. In our work, we provide an improvement over the current state-of-the-art method, by reverse engineering SPARQL queries using a hashing based recursive procedure. We empirically verify how hashing could largely benefit in reducing the size of the returned query and hence making it practically comprehensible for users or agents to understand the similarity concepts returned.
Language:
English
Type (Professor's evaluation):
Scientific
No. of pages:
10