Hashing for cleaner reverse engineered queries for the Entity Comparison Problem in RDF Graphs
- Resource Type
- Conference
- Authors
- Tyagi, Priyam; Malta, Mariana Curado; Dutta, Animesh
- Source
- 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) WI-IAT Web Intelligence and Intelligent Agent Technology (WI-IAT), 2020 IEEE/WIC/ACM International Joint Conference on. :177-186 Dec, 2020
- Subject
- Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Computing and Processing
Geoscience
Power, Energy and Industry Applications
Robotics and Control Systems
Signal Processing and Analysis
Transportation
Semantics
Reverse engineering
Web pages
Search problems
Information retrieval
Resource description framework
Software
Semantic Web
RDF
SPARQL
hashing
query variables
similarity query
agents
- Language
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.