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

Detalhes bibliográficos
Autor(a) principal: Valêncio, Carlos Roberto [UNESP]
Data de Publicação: 2011
Outros Autores: Costa, Leandro Rincon [UNESP], El Hetti Laurenti, Carlos Henrique [UNESP], Cansian, Adriano Mauro [UNESP]
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.22
http://hdl.handle.net/11449/72856
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.
id UNSP_867517956ec9dd3a0d8e00078a2c1660
oai_identifier_str oai:repositorio.unesp.br:11449/72856
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithmAnt colony optimisation algorithmDistributed databasesPeer-to-peer databasesPeer-to-peer networksRouting queriesSemanticsAnt coloniesAnt colony algorithmsDistributed databaseHeterogeneous databasePeer to peerPeer-to-peer databaseSchemasStructural characteristicsUser accessAlgorithmsInvestmentsPeer to peer networksQuery languagesDistributed computer systemsA 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.Unesp Depto. de Ciências de Computação e Estatística Universidade Estadual Paulista, São José do Rio PretoUnesp Depto. de Ciências de Computação e Estatística Universidade Estadual Paulista, São José do Rio PretoUniversidade Estadual Paulista (Unesp)Valêncio, Carlos Roberto [UNESP]Costa, Leandro Rincon [UNESP]El Hetti Laurenti, Carlos Henrique [UNESP]Cansian, Adriano Mauro [UNESP]2014-05-27T11:26:14Z2014-05-27T11:26:14Z2011-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject287-292http://dx.doi.org/10.1109/PDCAT.2011.22Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 287-292.http://hdl.handle.net/11449/7285610.1109/PDCAT.2011.222-s2.0-84856642173009592194334597446448122538758320000-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/72856Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T18:40:04.295432Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm
title Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm
spellingShingle Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm
Valêncio, Carlos Roberto [UNESP]
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
title_short Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm
title_full Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm
title_fullStr Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm
title_full_unstemmed Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm
title_sort Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm
author Valêncio, Carlos Roberto [UNESP]
author_facet Valêncio, Carlos Roberto [UNESP]
Costa, Leandro Rincon [UNESP]
El Hetti Laurenti, Carlos Henrique [UNESP]
Cansian, Adriano Mauro [UNESP]
author_role author
author2 Costa, Leandro Rincon [UNESP]
El Hetti Laurenti, Carlos Henrique [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]
El Hetti Laurenti, Carlos Henrique [UNESP]
Cansian, Adriano Mauro [UNESP]
dc.subject.por.fl_str_mv 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
topic 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
description 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.
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.22
Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 287-292.
http://hdl.handle.net/11449/72856
10.1109/PDCAT.2011.22
2-s2.0-84856642173
0095921943345974
4644812253875832
0000-0002-9325-3159
0000-0003-4494-1454
url http://dx.doi.org/10.1109/PDCAT.2011.22
http://hdl.handle.net/11449/72856
identifier_str_mv Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, p. 287-292.
10.1109/PDCAT.2011.22
2-s2.0-84856642173
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 287-292
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_ 1808128963837427712