Enabling dynamic querying over distributed hash tables (Articolo in rivista)

Type
Label
  • Enabling dynamic querying over distributed hash tables (Articolo in rivista) (literal)
Anno
  • 2010-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1016/j.jpdc.2010.08.012 (literal)
Alternative label
  • Domenico Talia, Paolo Trunfio (2010)
    Enabling dynamic querying over distributed hash tables
    in Journal of parallel and distributed computing (Print)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Domenico Talia, Paolo Trunfio (literal)
Pagina inizio
  • 1254 (literal)
Pagina fine
  • 1265 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://dx.doi.org/10.1016/j.jpdc.2010.08.012 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 70 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 12 (literal)
Note
  • DBLP (literal)
  • Scopu (literal)
  • ISI Web of Science (WOS) (literal)
  • Google Scholar (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Istituto di calcolo e reti ad alte prestazioni; Università della Calabria (literal)
Titolo
  • Enabling dynamic querying over distributed hash tables (literal)
Abstract
  • Dynamic querying (DQ) is a search technique used in unstructured peer-to-peer (P2P) networks to minimize the number of nodes that is necessary to visit to reach the desired number of results. In this paper, we introduce the use of the DQ technique in structured P2P networks. In particular, we present a P2P search algorithm, named DQ-DHT (Dynamic Querying over a Distributed Hash Table), to perform DQ-like searches over DHT-based overlays. The aim of DQ-DHT is twofold: allowing arbitrary queries to be performed in structured P2P networks and providing dynamic adaptation of the search according to the popularity of the resources to be located. DQ-DHT has been particularly designed for use in those distributed environments, like computational grids, where it is necessary to support arbitrary queries for searching resources on the basis of complex criteria or semantic features. This paper describes the DQ-DHT algorithm using Chord as basic overlay and analyzes its performance in comparison with DQ in unstructured networks. (literal)
Prodotto di
Autore CNR

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
data.CNR.it