• Jan 05, 2017 News![CFP] 2017 the annual meeting of IJFCC Editorial Board, ICCTD 2017, will be held in Paris, France during March 20-22, 2017.   [Click]
  • Mar 24, 2016 News! IJFCC Vol. 4, No. 4 has been indexed by EI (Inspec).   [Click]
  • Jun 28, 2017 News!Vol.6, No.3 has been published with online version.   [Click]
General Information
    • ISSN: 2010-3751
    • Frequency: Bimonthly (2012-2016); Quarterly (Since 2017)
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Mohamed Othman
    • Executive Editor: Ms. Nancy Y. Liu
    • Abstracting/ Indexing: Google Scholar, Engineering & Technology Digital Library, and Crossref, DOAJ, Electronic Journals LibraryEI (INSPEC, IET).
    • E-mail:  ijfcc@ejournal.net 
Prof. Mohamed Othman
Department of Communication Technology and Network Universiti Putra Malaysia, Malaysia
It is my honor to be the editor-in-chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.
IJFCC 2013 Vol.2(5):456-460 ISSN: 2010-3751
DOI: 10.7763/IJFCC.2013.V2.205

Usage of Kd-Tree in DHT-Based Indexing Scheme

Yi Yi Mar, Aung Htein Maw, and Khine Moe Nwe
Abstract—Distributed Hash Table (DHT) is a promising approach for a distributed data management platform in a large-scale network environment. In order to provide an efficient query processing and resource sharing in information discovery services, any DHT-based P2P system essentially needs to build an efficient indexing scheme for supporting users’ desired queries (complex query, i.e., multi-dimensional and/or range query). In this paper, multi-dimensional indexing scheme is built by generating multi-dimensional keys. For this purpose, k-dimensional tree (kd-tree) is proposed to be used in the indexing scheme. This paper focuses on the performance of kd-tree regarding to its splitting threshold value and evaluates it by using three metrics: (1) number of empty nodes on tree (2) number peers with data size zero, and (3) number of wrong labels. According to the simulated results, this paper defines that kd-tree is built at the splitting threshold value “200” and builds a multi-dimensional indexing scheme over Chord. This paper shows that how the proposed indexing scheme with the usage of kd-tree supports the complex query processing over Chord.

Index Terms—Indexing over DHT, complex query processing over DHT, DHT-based P2P query processing

The authors are with the University Computer Studies, Yangon, Myanmar (e-mail: yyimar@gmail.co, unghteinmaw@gmail.com, kmnweucsy@gmail.com).


Cite: Yi Yi Mar, Aung Htein Maw, and Khine Moe Nwe, "Usage of Kd-Tree in DHT-Based Indexing Scheme," International Journal of Future Computer and Communication vol. 2, no. 5, pp. 456-460, 2013.

Copyright © 2008-2016. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net