Dealing with inconsistencies in linked data mashups

Authors:
Eveline R. Sacramento;Marco A. Casanova;Karin K. Breitman;Antonio L. Furtado;José Antonio F. de Macědo;Vănia M. P. Vidal
Affiliations:
PUC-Rio, Rio de Janeiro, RJ - Brazil;PUC-Rio, Rio de Janeiro, RJ - Brazil;PUC-Rio, Rio de Janeiro, RJ - Brazil;PUC-Rio, Rio de Janeiro, RJ - Brazil;UFC, Fortaleza, CE - Brazil;UFC, Fortaleza, CE - Brazil
Venue:
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Year:
2012

Citing 5
Cited 0

A revival of integrity constraints for data cleaning

Proceedings of the VLDB Endowment
The DL-lite family and relations

Journal of Artificial Intelligence Research
Editorial: Revising the constraints of lightweight mediated schemas

Data & Knowledge Engineering
Integrating linked data through RDFS and OWL: some lessons learnt

RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
The role of constraints in linked data

OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data mashups constructed from independent sources may contain inconsistencies, puzzling the user that observes the data. This paper formalizes the notion of consistent data mashups and introduces a heuristic procedure to compute such mashups.