Schema Matching
Mostrando 1-6 de 6 artigos, teses e dissertações.
-
1. Ontology-based clustering in a Peer Data Management System
Peer Data Management Systems (PDMS) are advanced P2P applications which enable users to transparently query several distributed, heterogeneous, and autonomous data sources. Each peer represents a data source and exports its entire data schema or only a portion of it. Such schema, named exported schema, represents the data to be shared with the other peers of
Publicado em: 2009
-
2. INSTANCE-BASED SCHEMA MATCHING / ALINHAMENTO DE ESQUEMAS BASEADO EM INSTÂNCIAS
A mediator is a software component that helps accessing data sources. With the advent of the Web, the design of mediators imposes important challenges, such as the ability of providing integrated access to independent and dynamic data sources and the ability of resolving the semantic heterogeneity between different data source schemas. To deal with these cha
Publicado em: 2008
-
3. âA Context-based Name Resolution Approach for Semantic Schema Integrationâ
The Semantic Web envisages providing a broad range of services from various application domains on the Web. These services often work in a collaborative way and are based on decision-making tasks, which are performed better if they are able to take into account all the relevant information available. This scenario has given rise to technical developments in
Publicado em: 2008
-
4. A SOFTWARE INFRASTRUCTURE FOR CATALOG MATCHING / UMA INFRA-ESTRUTURA DE SOFTWARE PARA ALINHAMENTO DE CATÁLOGOS HETEROGÊNEOS
A maior parte dos bancos de dados existentes é projetada de maneira independente e, portanto, é geralmente implementada utilizando diferentes esquemas conceituais, criando um contexto de heterogeneidade em níveis sintático, estrutural e semântico. Não obstante, quando um conjunto de bancos de dados se refere a um mesmo domínio, eventualmente, surge a
Publicado em: 2008
-
5. Casamento de esquemas XML e esquemas relacionais / Matching of XML schemas and relational schema
O casamento entre esquemas XML e esquemas relacionais é necessário em diversas aplicações, tais como integração de informação e intercâmbio de dados. Tipicamente o casamento de esquemas é um processo manual, talvez suportado por uma interface grá ca. No entanto, o casamento manual de esquemas muito grandes é um processo dispendioso e sujeito a er
Publicado em: 2007
-
6. PRINTS-S: the database formerly known as PRINTS
The PRINTS database houses a collection of protein family fingerprints. These are groups of motifs that together are diagnostically more potent than single motifs by virtue of the biological context afforded by matching motif neighbours. Around 1200 fingerprints have now been created and stored in the database. The September 1999 release (version 24.0) encod
Oxford University Press.