Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support
Autor(a) principal: | |
---|---|
Data de Publicação: | 2011 |
Outros Autores: | , , |
Tipo de documento: | Artigo de conferência |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1109/PDCAT.2011.23 http://hdl.handle.net/11449/72857 |
Resumo: | In a peer-to-peer network, the nodes interact with each other by sharing resources, services and information. Many applications have been developed using such networks, being a class of such applications are peer-to-peer databases. The peer-to-peer databases systems allow the sharing of unstructured data, being able to integrate data from several sources, without the need of large investments, because they are used existing repositories. However, the high flexibility and dynamicity of networks the network, as well as the absence of a centralized management of information, becomes complex the process of locating information among various participants in the network. In this context, this paper presents original contributions by a proposed architecture for a routing system that uses the Ant Colony algorithm to optimize the search for desired information supported by ontologies to add semantics to shared data, enabling integration among heterogeneous databases and the while seeking to reduce the message traffic on the network without causing losses in the amount of responses, confirmed by the improve of 22.5% in this amount. © 2011 IEEE. |
id |
UNSP_e6c00cb392ae47b592ba2f4a57eb772b |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/72857 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic supportAnt colony optimisation algorithmDistributed databasesPeer-to-peer databasePeer-to-peer networksRouting queriesSemanticsAnt colony algorithmsCentralized managementDistributed databaseHeterogeneous databaseHigh flexibilityMessage trafficPeer to peerProposed architecturesRouting systemShared dataUnstructured dataAlgorithmsDatabase systemsDistributed computer systemsNetwork architecturePeer to peer networksSearch enginesInformation managementIn a peer-to-peer network, the nodes interact with each other by sharing resources, services and information. Many applications have been developed using such networks, being a class of such applications are peer-to-peer databases. The peer-to-peer databases systems allow the sharing of unstructured data, being able to integrate data from several sources, without the need of large investments, because they are used existing repositories. However, the high flexibility and dynamicity of networks the network, as well as the absence of a centralized management of information, becomes complex the process of locating information among various participants in the network. In this context, this paper presents original contributions by a proposed architecture for a routing system that uses the Ant Colony algorithm to optimize the search for desired information supported by ontologies to add semantics to shared data, enabling integration among heterogeneous databases and the while seeking to reduce the message traffic on the network without causing losses in the amount of responses, confirmed by the improve of 22.5% in this amount. © 2011 IEEE.Depto. de Ciências de Computação e Estatística Universidade Estadual Paulista - Unesp, São José do Rio PretoDepto. de Ciências de Computação e Estatística Universidade Estadual Paulista - Unesp, São José do Rio PretoUniversidade Estadual Paulista (Unesp)Valêncio, Carlos Roberto [UNESP]Costa, Leandro Rincon [UNESP]Neto, Paulo Scarpelini [UNESP]Cansian, Adriano Mauro [UNESP]2014-05-27T11:26:14Z2014-05-27T11:26:14Z2011-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject263-268http://dx.doi.org/10.1109/PDCAT.2011.23Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 263-268.http://hdl.handle.net/11449/7285710.1109/PDCAT.2011.232-s2.0-84856655809009592194334597446448122538758320000-0002-9325-31590000-0003-4494-1454Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengParallel and Distributed Computing, Applications and Technologies, PDCAT Proceedingsinfo:eu-repo/semantics/openAccess2021-10-23T21:44:33Zoai:repositorio.unesp.br:11449/72857Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T19:49:34.318068Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support |
title |
Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support |
spellingShingle |
Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support Valêncio, Carlos Roberto [UNESP] Ant colony optimisation algorithm Distributed databases Peer-to-peer database Peer-to-peer networks Routing queries Semantics Ant colony algorithms Centralized management Distributed database Heterogeneous database High flexibility Message traffic Peer to peer Proposed architectures Routing system Shared data Unstructured data Algorithms Database systems Distributed computer systems Network architecture Peer to peer networks Search engines Information management |
title_short |
Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support |
title_full |
Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support |
title_fullStr |
Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support |
title_full_unstemmed |
Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support |
title_sort |
Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support |
author |
Valêncio, Carlos Roberto [UNESP] |
author_facet |
Valêncio, Carlos Roberto [UNESP] Costa, Leandro Rincon [UNESP] Neto, Paulo Scarpelini [UNESP] Cansian, Adriano Mauro [UNESP] |
author_role |
author |
author2 |
Costa, Leandro Rincon [UNESP] Neto, Paulo Scarpelini [UNESP] Cansian, Adriano Mauro [UNESP] |
author2_role |
author author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) |
dc.contributor.author.fl_str_mv |
Valêncio, Carlos Roberto [UNESP] Costa, Leandro Rincon [UNESP] Neto, Paulo Scarpelini [UNESP] Cansian, Adriano Mauro [UNESP] |
dc.subject.por.fl_str_mv |
Ant colony optimisation algorithm Distributed databases Peer-to-peer database Peer-to-peer networks Routing queries Semantics Ant colony algorithms Centralized management Distributed database Heterogeneous database High flexibility Message traffic Peer to peer Proposed architectures Routing system Shared data Unstructured data Algorithms Database systems Distributed computer systems Network architecture Peer to peer networks Search engines Information management |
topic |
Ant colony optimisation algorithm Distributed databases Peer-to-peer database Peer-to-peer networks Routing queries Semantics Ant colony algorithms Centralized management Distributed database Heterogeneous database High flexibility Message traffic Peer to peer Proposed architectures Routing system Shared data Unstructured data Algorithms Database systems Distributed computer systems Network architecture Peer to peer networks Search engines Information management |
description |
In a peer-to-peer network, the nodes interact with each other by sharing resources, services and information. Many applications have been developed using such networks, being a class of such applications are peer-to-peer databases. The peer-to-peer databases systems allow the sharing of unstructured data, being able to integrate data from several sources, without the need of large investments, because they are used existing repositories. However, the high flexibility and dynamicity of networks the network, as well as the absence of a centralized management of information, becomes complex the process of locating information among various participants in the network. In this context, this paper presents original contributions by a proposed architecture for a routing system that uses the Ant Colony algorithm to optimize the search for desired information supported by ontologies to add semantics to shared data, enabling integration among heterogeneous databases and the while seeking to reduce the message traffic on the network without causing losses in the amount of responses, confirmed by the improve of 22.5% in this amount. © 2011 IEEE. |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011-12-01 2014-05-27T11:26:14Z 2014-05-27T11:26:14Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/conferenceObject |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1109/PDCAT.2011.23 Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 263-268. http://hdl.handle.net/11449/72857 10.1109/PDCAT.2011.23 2-s2.0-84856655809 0095921943345974 4644812253875832 0000-0002-9325-3159 0000-0003-4494-1454 |
url |
http://dx.doi.org/10.1109/PDCAT.2011.23 http://hdl.handle.net/11449/72857 |
identifier_str_mv |
Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 263-268. 10.1109/PDCAT.2011.23 2-s2.0-84856655809 0095921943345974 4644812253875832 0000-0002-9325-3159 0000-0003-4494-1454 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
263-268 |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808129124609294336 |