You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/72861
Full metadata record
DC FieldValueLanguage
dc.contributor.authorValêncio, Carlos Roberto-
dc.contributor.authorCosta, Leandro Rincon-
dc.contributor.authorCarreira, Juliano Augusto-
dc.contributor.authorTronco, Mario Luiz-
dc.date.accessioned2014-05-27T11:26:14Z-
dc.date.accessioned2016-10-25T18:35:52Z-
dc.date.available2014-05-27T11:26:14Z-
dc.date.available2016-10-25T18:35:52Z-
dc.date.issued2011-12-01-
dc.identifierhttp://dx.doi.org/10.1109/PDCAT.2011.59-
dc.identifier.citationParallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 281-286.-
dc.identifier.urihttp://hdl.handle.net/11449/72861-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/72861-
dc.description.abstractThe development of new technologies that use peer-to-peer networks grows every day, with the object to supply the need of sharing information, resources and services of databases around the world. Among them are the peer-to-peer databases that take advantage of peer-to-peer networks to manage distributed knowledge bases, allowing the sharing of information semantically related but syntactically heterogeneous. However, it is a challenge to ensure the efficient search for information without compromising the autonomy of each node and network flexibility, given the structural characteristics of these networks. On the other hand, some studies propose the use of ontology semantics by assigning standardized categorization of information. The main original contribution of this work is the approach of this problem with a proposal for optimization of queries supported by the Ant Colony algorithm and classification though ontologies. The results show that this strategy enables the semantic support to the searches in peer-to-peer databases, aiming to expand the results without compromising network performance. © 2011 IEEE.en
dc.format.extent281-286-
dc.language.isoeng-
dc.sourceScopus-
dc.subjectAnt colony algorithm-
dc.subjectDistributed databases-
dc.subjectPeer-to-peer database-
dc.subjectRouting queries-
dc.subjectSemantic-
dc.subjectAnt colony algorithms-
dc.subjectDistributed database-
dc.subjectDistributed knowledge-
dc.subjectNetwork flexibility-
dc.subjectOntology semantics-
dc.subjectPeer to peer-
dc.subjectQuery results-
dc.subjectSharing information-
dc.subjectStructural characteristics-
dc.subjectAlgorithms-
dc.subjectDatabase systems-
dc.subjectNetwork performance-
dc.subjectOptimization-
dc.subjectPeer to peer networks-
dc.subjectSemantics-
dc.subjectDistributed computer systems-
dc.titleOptimization of query results in peer-to-peer database supported by semanticsen
dc.typeoutro-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.contributor.institutionUniversidade de São Paulo (USP)-
dc.description.affiliationDepto. de Ciências de Computação e Estatística Universidade Estadual Paulista - Unesp, São José do Rio Preto-
dc.description.affiliationDepartamento de Engenharia Mecânica Universidade de São Paulo - USP, São Carlos-
dc.description.affiliationUnespDepto. de Ciências de Computação e Estatística Universidade Estadual Paulista - Unesp, São José do Rio Preto-
dc.identifier.doi10.1109/PDCAT.2011.59-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofParallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings-
dc.identifier.scopus2-s2.0-84856682550-
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.