UCSY's Research Repository

Efficient Indexing Scheme over DHT

Show simple item record

dc.contributor.author Mar, Yi Yi
dc.contributor.author Nwe, Khine Moe
dc.contributor.author Maw, Aung Htein
dc.date.accessioned 2019-07-03T04:23:05Z
dc.date.available 2019-07-03T04:23:05Z
dc.date.issued 2011-05-05
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/194
dc.description.abstract Range query processing is an essential role in many P2P applications including database indexing, distributed computing and location aware computing and commercial services based on current user’s location. Most of P2P applications are running over DHT overlay network. But most of DHT can only provide for exact match queries. If there is no an efficient indexing scheme over DHTs, complex queries such as range queries may be major challenge. So in recent years, there are many indexing schemes over DHTs are proposed for range query processing. In this paper, an efficient indexing scheme is proposed for multidimensional range query processing. For building the proposed scheme, data are firstly distributed over peer nodes. For fairly distributing of data, k-dimensional tree (kd-tree) is used. While partitioning data on kd-tree, splitting points with each dimension are generated. Leave nodes of kd-tree store data records with tree information including splitting points. The proposed indexing scheme is built using these stored tree information. By using the proposed system, bandwidth and time consuming in range query processing over DHTs can reduce. en_US
dc.language.iso en en_US
dc.publisher Ninth International Conference On Computer Applications (ICCA 2011) en_US
dc.subject Indexing over DHT en_US
dc.subject range query processing en_US
dc.subject range query in P2P systems en_US
dc.title Efficient Indexing Scheme over DHT en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


My Account