Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm

Nenhuma Miniatura disponível

Data

2011-12-01

Autores

Valêncio, Carlos Roberto [UNESP]
Costa, Leandro Rincon [UNESP]
El Hetti Laurenti, Carlos Henrique [UNESP]
Cansian, Adriano Mauro [UNESP]

Título da Revista

ISSN da Revista

Título de Volume

Editor

Resumo

A significant set of information stored in different databases around the world, can be shared through peer-topeer databases. With that, is obtained a large base of knowledge, without the need for large investments because they are used existing databases, as well as the infrastructure in place. However, the structural characteristics of peer-topeer, makes complex the process of finding such information. On the other side, these databases are often heterogeneous in their schemas, but semantically similar in their content. A good peer-to-peer databases systems should allow the user access information from databases scattered across the network and receive only the information really relate to your topic of interest. This paper proposes to use ontologies in peer-to-peer database queries to represent the semantics inherent to the data. The main contribution of this work is enable integration between heterogeneous databases, improve the performance of such queries and use the algorithm of optimization Ant Colony to solve the problem of locating information on peer-to-peer networks, which presents an improve of 18% in results. © 2011 IEEE.

Descrição

Palavras-chave

Ant colony optimisation algorithm, Distributed databases, Peer-to-peer databases, Peer-to-peer networks, Routing queries, Semantics, Ant colonies, Ant colony algorithms, Distributed database, Heterogeneous database, Peer to peer, Peer-to-peer database, Schemas, Structural characteristics, User access, Algorithms, Investments, Peer to peer networks, Query languages, Distributed computer systems

Como citar

Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 287-292.