Article: Improving multidimensional point query search using multi-way peer-to-peer tree network Journal: International Journal of Information and Communication Technology (IJICT) 2019 Vol.14 No.2 pp.125 - 138 Abstract: Nowadays, peer-to-peer (P2P) networks are widely accepted in multidimensional applications like social networking, multiplayer games, P2P e-learning, P2P mobile ad-hoc networks, etc. Various P2P overlay networks combining multidimensional indexing (MI) methods are preferable for efficient multidimensional point or range search in a distributed environment. However, point query search in existing P2P has limitations viz.: 1) either does not give support to MI or uses replications to support MI; 2) point query search cost is limited to O(log2N). Hence, traditional MI techniques based on the multi-way tree structure (having larger fan-out) can be employed to enhance the multidimensional point query search capabilities. Based on our observations, a hybrid model combining m-ary (m fan-out of the tree, > 2) P2P tree network and MI based on space containment relationships is preferred to reduce point query search performance bound to O(logmN) using single overlay network. The present paper shows how this model improves the search performance of the point queries in O(logmN) steps, independent of the dimensionality of objects. Inderscience Publishers - linking academia, business and industry through research

Title: Improving multidimensional point query search using multi-way peer-to-peer tree network

Authors: Shivangi Surati; Devesh C. Jinwala; Sanjay Garg

Addresses: Department of Computer Engineering, Sardar Vallabhbhai National Institute of Technology, Surat, Gujarat 395007, India ' Department of Computer Engineering, Sardar Vallabhbhai National Institute of Technology, Surat, Gujarat 395007, India ' Department of Computer Engineering, Institute of Technology, Nirma University, Ahmedabad, Gujarat 382481, India

Abstract: Nowadays, peer-to-peer (P2P) networks are widely accepted in multidimensional applications like social networking, multiplayer games, P2P e-learning, P2P mobile ad-hoc networks, etc. Various P2P overlay networks combining multidimensional indexing (MI) methods are preferable for efficient multidimensional point or range search in a distributed environment. However, point query search in existing P2P has limitations viz.: 1) either does not give support to MI or uses replications to support MI; 2) point query search cost is limited to O(log₂N). Hence, traditional MI techniques based on the multi-way tree structure (having larger fan-out) can be employed to enhance the multidimensional point query search capabilities. Based on our observations, a hybrid model combining m-ary (m fan-out of the tree, > 2) P2P tree network and MI based on space containment relationships is preferred to reduce point query search performance bound to O(log_mN) using single overlay network. The present paper shows how this model improves the search performance of the point queries in O(log_mN) steps, independent of the dimensionality of objects.

Keywords: peer-to-peer overlay networks; distributed computing; point query search; multi-way trees; multidimensional indexing.

DOI: 10.1504/IJICT.2019.097685

International Journal of Information and Communication Technology, 2019 Vol.14 No.2, pp.125 - 138

Accepted: 12 Jul 2016
Published online: 05 Feb 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Improving multidimensional point query search using multi-way peer-to-peer tree network

Keep up-to-date