Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Hashing for cleaner reverse engineered queries for the Entity Comparison Problem in RDF Graphs
Publication

Publications

Hashing for cleaner reverse engineered queries for the Entity Comparison Problem in RDF Graphs

Title
Hashing for cleaner reverse engineered queries for the Entity Comparison Problem in RDF Graphs
Type
Article in International Conference Proceedings Book
Year
2020
Authors
Tyagi, P
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Malta, MC
(Author)
Other
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Dutta, A
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Conference proceedings International
Pages: 177-186
IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)
ELECTR NETWORK, DEC 14-17, 2020
Indexing
Publicação em ISI Web of Knowledge ISI Web of Knowledge - 0 Citations
Publicação em Scopus Scopus - 0 Citations
Other information
Authenticus ID: P-00V-CHT
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
Documents
We could not find any documents associated to the publication.
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-09-06 at 10:39:41 | Privacy Policy | Personal Data Protection Policy | Whistleblowing