2024-03-28T15:47:29Z
https://meral.edu.mm/oai
oai:meral.edu.mm:recid/4235
2021-12-13T03:27:35Z
1582963302567:1597824273898
user-ucsy
Efficient Indexing Scheme over DHT
Mar, Yi Yi
Nwe, Khine Moe
Maw, Aung Htein
Range query processing is an essential role inmany P2P applications including databaseindexing, distributed computing and locationaware computing and commercial services basedon current user’s location. Most of P2Papplications are running over DHT overlaynetwork. But most of DHT can only provide forexact match queries. If there is no an efficientindexing scheme over DHTs, complex queriessuch as range queries may be major challenge.So in recent years, there are many indexingschemes over DHTs are proposed for rangequery processing. In this paper, an efficientindexing scheme is proposed formultidimensional range query processing. Forbuilding the proposed scheme, data are firstlydistributed over peer nodes. For fairlydistributing of data, k-dimensional tree (kd-tree)is used. While partitioning data on kd-tree,splitting points with each dimension aregenerated. Leave nodes of kd-tree store datarecords with tree information including splittingpoints. The proposed indexing scheme is builtusing these stored tree information. By using theproposed system, bandwidth and time consumingin range query processing over DHTs canreduce.
2011-05-05
http://hdl.handle.net/20.500.12678/0000004235
https://meral.edu.mm/records/4235