http://www.cnr.it/ontology/cnr/individuo/prodotto/ID92031

DDT: a distributed data structure for the support of P2P range query (Contributo in atti di convegno)

Type

Label

DDT: a distributed data structure for the support of P2P range query (Contributo in atti di convegno) (literal)

Anno

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi

Alternative label

Carfi D., Coppola M., Laforenza D., Ricci L. (2009)
DDT: a distributed data structure for the support of P2P range query
in 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing, Washington, DC, 11-14 Nov. 2009
(literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note

In: CollaborateCom 2009. - 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing (Washington, DC, 11-14 November 2009). Proceedings, pp. 1 - 10. IEEE, 2009. (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto

This paper defines and evaluates a hierarchical distributed data structure, distributed digest trie, supporting range queries in P2P systems. Providing efficient support for these queries is currently a challenging research issue in the P2P field, as classical approaches based on distributed hash tables (DHT) are often not suitable for this kind of queries, due to the loss of locality introduced by the hashing function. Distributed digest trie exploits the DHT only to define a uniform assignment of logical identifiers to peers while each key is managed by the peer publishing it. Each peer is paired with the leaf of the trie corresponding to its logical identifier. An internal node of the trie stores a digest summarizing the keys published by the peers paired with the leaves of the tree rooted at that node. A proper mapping function is defined to map the internal nodes of the trie to the peers. The digests stored at the internal nodes are exploited to guide the search process for the resolution of the range query. Different aggregation techniques are proposed. A set of experimental results compare these techniques, evaluate the cost of dynamic updates of the data structure and the network traffic generated by the method. (literal)

Note

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

Titolo

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn

Abstract

This paper defines and evaluates a hierarchical distributed data structure, Distributed Digest Trie, supporting range queries in P2P systems. Providing efficient support for these queries is currently a challenging research issue in the P2P field, as classical approaches based on Distributed Hash Tables (DHT) are often not suitable for this kind of queries, due to the loss of locality introduced by the hashing function. Distributed Digest Trie exploits the DHT only to define a uniform assignment of logical identifiers to peers while each key is managed by the peer publishing it. Each peer is paired with the leaf of the trie corresponding to its logical identifier. An internal node of the trie stores a digest summarizing the keys published by the peers paired with the leaves of the tree rooted at that node. A proper mapping function is defined to map the internal nodes of the trie to the peers. The digests stored at the internal nodes are exploited to guide the search process for the resolution of the range query. Different aggregation techniques are proposed. A set of experimental results compare these techniques, evaluate the cost of dynamic updates of the data structure and the network traffic generated by the method. (literal)

Prodotto di

Autore CNR

Insieme di parole chiave

Prodotto

Autore CNR di

Insieme di parole chiave di

data.CNR.it