1. RI UFLA
  2. Revistas UFLA
  3. Infocomp
Use este identificador para citar ou linkar para este item: http://repositorio.ufla.br/jspui/handle/1/15047
Registro completo de metadados
Campo DCValorIdioma
dc.creatorKharma, Qasem-
dc.creatorEge, Raimund-
dc.creatorShaar, Said Abu-
dc.date2007-06-01-
dc.date.accessioned2017-08-01T21:08:50Z-
dc.date.available2017-08-01T21:08:50Z-
dc.date.issued2017-08-01-
dc.identifier.citationKHARMA, Q.; EGE, R.; SHAAR, S. A. E-Chord: keyword-based search algorithm based on DHT in mediation architecture. INFOCOMP Journal of Computer Science, Lavras, v. 6, n. 2, p. 37-45, Jun. 2007.-
dc.identifier.urihttp://repositorio.ufla.br/jspui/handle/1/15047-
dc.description.abstractE-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).-
dc.formatapplication/pdf-
dc.languageeng-
dc.publisherUniversidade Federal de Lavras (UFLA)-
dc.relationhttp://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/172/157-
dc.rightsCopyright (c) 2016 INFOCOMP Journal of Computer Science-
dc.rightsAttribution 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.sourceINFOCOMP; Vol 6 No 2 (2007): June, 2007; 37-45-
dc.source1982-3363-
dc.source1807-4545-
dc.subjectDistributed Hash Table algorithm (DHT)-
dc.subjectMediation-
dc.subjectHeterogeneous data integration-
dc.titleE-Chord: keyword-based search algorithm based on DHT in mediation architecture-
dc.typeinfo:eu-repo/semantics/article-
dc.typeinfo:eu-repo/semantics/publishedVersion-
Aparece nas coleções:Infocomp

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
ARTIGO_E-Chord keyword-based search algorithm based on DHT in mediation architecture.pdf225,01 kBAdobe PDFVisualizar/Abrir
Mostrar registro simples do item Recomendar este item Visualizar estatísticas


Este item está licenciada sob uma Licença Creative Commons Creative Commons