Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/72857
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Valêncio, Carlos Roberto | - |
dc.contributor.author | Costa, Leandro Rincon | - |
dc.contributor.author | Neto, Paulo Scarpelini | - |
dc.contributor.author | Cansian, Adriano Mauro | - |
dc.date.accessioned | 2014-05-27T11:26:14Z | - |
dc.date.accessioned | 2016-10-25T18:35:52Z | - |
dc.date.available | 2014-05-27T11:26:14Z | - |
dc.date.available | 2016-10-25T18:35:52Z | - |
dc.date.issued | 2011-12-01 | - |
dc.identifier | http://dx.doi.org/10.1109/PDCAT.2011.23 | - |
dc.identifier.citation | Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 263-268. | - |
dc.identifier.uri | http://hdl.handle.net/11449/72857 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/72857 | - |
dc.description.abstract | 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. | en |
dc.format.extent | 263-268 | - |
dc.language.iso | eng | - |
dc.source | Scopus | - |
dc.subject | Ant colony optimisation algorithm | - |
dc.subject | Distributed databases | - |
dc.subject | Peer-to-peer database | - |
dc.subject | Peer-to-peer networks | - |
dc.subject | Routing queries | - |
dc.subject | Semantics | - |
dc.subject | Ant colony algorithms | - |
dc.subject | Centralized management | - |
dc.subject | Distributed database | - |
dc.subject | Heterogeneous database | - |
dc.subject | High flexibility | - |
dc.subject | Message traffic | - |
dc.subject | Peer to peer | - |
dc.subject | Proposed architectures | - |
dc.subject | Routing system | - |
dc.subject | Shared data | - |
dc.subject | Unstructured data | - |
dc.subject | Algorithms | - |
dc.subject | Database systems | - |
dc.subject | Distributed computer systems | - |
dc.subject | Network architecture | - |
dc.subject | Peer to peer networks | - |
dc.subject | Search engines | - |
dc.subject | Information management | - |
dc.title | Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support | en |
dc.type | outro | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.description.affiliation | Depto. de Ciências de Computação e Estatística Universidade Estadual Paulista - Unesp, São José do Rio Preto | - |
dc.description.affiliationUnesp | Depto. de Ciências de Computação e Estatística Universidade Estadual Paulista - Unesp, São José do Rio Preto | - |
dc.identifier.doi | 10.1109/PDCAT.2011.23 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings | - |
dc.identifier.scopus | 2-s2.0-84856655809 | - |
Appears in Collections: | Artigos, TCCs, Teses e Dissertações da Unesp |
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.