ScholarLens Back to search
2009•Unpublished venueRequires access

A Range Query Model Based on DHT in P2P System

Dan Wang, LI Mao-zeng

Open publisher page 3 citations

Abstract

A peer-to-peer (P2P) system has emerged as one of the most successful ways to share resources in distributed environment, and DHT(distributed hash table) is used as an effective approach to locate shared resources in a P2P system. This paper describes an extended DHT model by combining DHT with B+ tree. The sharing resources are represented by their attributes. Each query request is associated with ranges in one or more attributes, and B+ tree is introduced to organize the values of each attribute. In order to implement and verify our model, chord is chosen as the underlying DHT system. In addition to equality queries, this model also makes it possible to execute range queries over a DHT. The relevant technologies mapping from B+ trees to chord system are described. The node adding and leaving process and range query process are illustrated.

About this research paper

What this paper is about

A peer-to-peer (P2P) system has emerged as one of the most successful ways to share resources in distributed environment, and DHT(distributed hash table) is used as an effective approach to locate shared resources in a P2P system. This paper describes an extended DHT model by combining DHT with B+ tree. The sharing resources are represented by their attributes. Each query request is associated with ranges in one or more attributes, and B+ tree is introduced to organize the values of each attribute. In order to implement and verify our model, chord is chosen as the underlying DHT system. In addition to equality queries, this model also makes it possible to execute range queries over a DHT. The relevant technologies mapping from B+ trees to chord system are described. The node adding and leaving process and range query process are illustrated.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A peer-to-peer (P2P) system has emerged as one of the most successful ways to share resources in distributed environment, and DHT(distributed hash table) is used as an effective approach to locate shared resources in a P2P system. This paper describes an extended DHT model by combining DHT with B+ tree. The sharing resources are represented by their attributes. Each query request is associated with ranges in one or more attributes, and B+ tree is introduced to organize the values of each attribute. In order to implement and verify our model, chord is chosen as the underlying DHT system. In addition to equality queries, this model also makes it possible to execute range queries over a DHT. The relevant technologies mapping from B+ trees to chord system are described. The node adding and leaving process and range query process are illustrated.

Key concepts: Distributed hash table, Chord (peer-to-peer), Computer science, Peer-to-peer, Hash table, Hash function, Distributed computing, Range (aeronautics)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Range Query Model Based on DHT in P2P System — Research Paper | ScholarLens