Luiz André P. Paes Leme

Learn More
Schema matching is a fundamental issue in many database applications , such as query mediation and data warehousing. It becomes a challenge when different vocabularies are used to refer to the same real-world concepts. In this context, a convenient approach, sometimes called extensional, instance-based or semantic, is to detect how the same real world(More)
The Linked Data initiative promotes the publication of previously isolated databases as interlinked RDF datasets, thereby creating a global scale data space, known as the Web of Data. Linked Data Mashup applications, which consume data from the multiple Linked Data sources in the Web of Data, are confronted with the challenge of obtaining a homogenized view(More)
One of the design principles that can stimulate the growth and increase the usefulness of the Web of data is URIs linkage. However, the related URIs are typically in different datasets managed by different publishers. Hence, the designer of a new dataset must be aware of the existing datasets and inspect their content to define sameAs links. This paper(More)
A catalogue holds information about a set of objects, typically classified using terms taken from a given thesaurus, and described with the help of a set of attributes. Matching a pair of catalogues means to find a relationship between the terms of their thesauri and a relationship between their attributes. This paper first introduces a matching approach,(More)
Tripleset interlinking is one of the main principles of Linked Data. However, the discovery of existing triplesets relevant to be linked with a new tripleset is a non-trivial task in the publishing process. Without prior knowledge about the entire Web of Data, a data publisher must perform an exploratory search, which demands substantial effort and may(More)
Property mapping is a fundamental component of ontology matching, and yet there is little support that goes beyond the identification of single property matches. Real data often requires some degree of composition, trivially exemplified by the mapping of FirstName, LastName to FullName on one end, to complex machings, such as parsing and pairing(More)
In this paper, we address the problem of changing the constraints of a mediated schema M to accommodate the constraints of a new export schema E 0. We first show how to translate the constraints of E 0 to the vocabulary of M, creating a set of constraints C 0 in such a way that the schema mapping for E 0 is correct. Then, we show how to compute the new(More)
Schema matching is a fundamental issue to many database applications, such as query mediation and data warehousing. It becomes a challenge when different vocabularies are used to refer to the same real-world concepts. In this context, a convenient approach, sometimes called ex-tensional, instance-based, or semantic, is to detect how the same real world(More)
The Linked Data initiative promotes the publication of previously isolated databases as interlinked RDF datasets, thereby creating a global scale data space. Datasets are frequently interlinked using some automated matching process that results in a materialized sameAs linkset, that is, a set of links of the form (s, owl:sameAs, o), which asserts that s(More)