E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture

Detalhes bibliográficos
Autor(a) principal: Kharma, Qasem
Data de Publicação: 2007
Outros Autores: Ege, Raimund, Shaar, Said Abu
Tipo de documento: Artigo
Idioma: eng
Título da fonte: INFOCOMP: Jornal de Ciência da Computação
Texto Completo: https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/172
Resumo: E-Chord is a Distributed Hash Table algorithm (DHT) inspired from Chord, Pastry and CAN algorithms. It meant to provide a keyword-based search in the Three-Layer Mediation Architecture. The E-Chord is deployed in the middle layer (Integration Layer) of the architecture and provides services to the higher layer (Presence Layer) and the lower layer (Homogenization Layer).
id UFLA-5_cc581fc32cd4be9ccea4bfcaad6edf83
oai_identifier_str oai:infocomp.dcc.ufla.br:article/172
network_acronym_str UFLA-5
network_name_str INFOCOMP: Jornal de Ciência da Computação
repository_id_str
spelling E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation ArchitectureDHTMediationHeterogeneous Data IntegrationE-Chord is a Distributed Hash Table algorithm (DHT) inspired from Chord, Pastry and CAN algorithms. It meant to provide a keyword-based search in the Three-Layer Mediation Architecture. The E-Chord is deployed in the middle layer (Integration Layer) of the architecture and provides services to the higher layer (Presence Layer) and the lower layer (Homogenization Layer).Editora da UFLA2007-06-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/172INFOCOMP Journal of Computer Science; Vol. 6 No. 2 (2007): June, 2007; 37-451982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/172/157Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessKharma, QasemEge, RaimundShaar, Said Abu2015-06-27T23:27:43Zoai:infocomp.dcc.ufla.br:article/172Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:21.991711INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true
dc.title.none.fl_str_mv E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture
title E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture
spellingShingle E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture
Kharma, Qasem
DHT
Mediation
Heterogeneous Data Integration
title_short E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture
title_full E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture
title_fullStr E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture
title_full_unstemmed E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture
title_sort E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture
author Kharma, Qasem
author_facet Kharma, Qasem
Ege, Raimund
Shaar, Said Abu
author_role author
author2 Ege, Raimund
Shaar, Said Abu
author2_role author
author
dc.contributor.author.fl_str_mv Kharma, Qasem
Ege, Raimund
Shaar, Said Abu
dc.subject.por.fl_str_mv DHT
Mediation
Heterogeneous Data Integration
topic DHT
Mediation
Heterogeneous Data Integration
description E-Chord is a Distributed Hash Table algorithm (DHT) inspired from Chord, Pastry and CAN algorithms. It meant to provide a keyword-based search in the Three-Layer Mediation Architecture. The E-Chord is deployed in the middle layer (Integration Layer) of the architecture and provides services to the higher layer (Presence Layer) and the lower layer (Homogenization Layer).
publishDate 2007
dc.date.none.fl_str_mv 2007-06-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/172
url https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/172
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/172/157
dc.rights.driver.fl_str_mv Copyright (c) 2016 INFOCOMP Journal of Computer Science
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Copyright (c) 2016 INFOCOMP Journal of Computer Science
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Editora da UFLA
publisher.none.fl_str_mv Editora da UFLA
dc.source.none.fl_str_mv INFOCOMP Journal of Computer Science; Vol. 6 No. 2 (2007): June, 2007; 37-45
1982-3363
1807-4545
reponame:INFOCOMP: Jornal de Ciência da Computação
instname:Universidade Federal de Lavras (UFLA)
instacron:UFLA
instname_str Universidade Federal de Lavras (UFLA)
instacron_str UFLA
institution UFLA
reponame_str INFOCOMP: Jornal de Ciência da Computação
collection INFOCOMP: Jornal de Ciência da Computação
repository.name.fl_str_mv INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)
repository.mail.fl_str_mv infocomp@dcc.ufla.br||apfreire@dcc.ufla.br
_version_ 1799874740430569472

Registros relacionados