Skip to Main content Skip to Navigation
Conference papers

A Parallel Implementation of GHB Tree

Abstract : Searching in a dataset remains a fundamental problem for many applications. The general purpose of many similarity measures is to focus the search on as few elements as possible to find the answer. The current indexing techniques divides the target dataset into subsets. However, in large amounts of data, the volume of these regions explodes, which will affect search algorithms. The research tends to degenerate into a complete analysis of the data set. In this paper, we proposed a new indexing technique called GHB-tree. The first idea, is to limit the volume of the space. The goal is to eliminate some objects without the need to compute their relative distances to a query object. Peer-to-peer networks (P2P) are superimposed networks that connect independent computers (also known as nodes or peers). GHB-tree has been optimized for secondary memory in peer-to-peer networks. We proposed a parallel search algorithm on a set of real machine. We also discussed the effectiveness of construction and search algorithms, as well as the quality of the index.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, November 7, 2018 - 10:50:40 AM
Last modification on : Thursday, November 8, 2018 - 1:04:13 PM
Long-term archiving on: : Friday, February 8, 2019 - 1:59:21 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Zineddine Kouahla, Adeel Anjum. A Parallel Implementation of GHB Tree. 6th IFIP International Conference on Computational Intelligence and Its Applications (CIIA), May 2018, Oran, Algeria. pp.47-55, ⟨10.1007/978-3-319-89743-1_5⟩. ⟨hal-01913954⟩



Record views


Files downloads