Al-Bahir Journal for Engineering and Pure Sciences


The fast increase in volume and speed of information created by mobile devices, along with the availability of web-based applications, has considerably contributed to the massive collection of data. Approximate Nearest Neighbor (ANN) is essential in big size databases for comparison search to offer the nearest neighbor of a given query in the field of computer vision and pattern recognition. Many hashing algorithms have been developed to improve data management and retrieval accuracy in huge databases. However, none of these algorithms took bandwidth into consideration, which is a significant aspect in information retrieval and pattern recognition. As a result, our work created a Geo-SPEBH algorithm to solve this basic gap. The paper then assesses the performance of the Geo-SPEBH algorithm in terms of bandwidth in a distributed computing environment. Geo-performance SPEBH's was compared to existing state-of-the-art approaches using a network analyzer called Wire shark. The simulation results reveal that during retrieval, the same kb/sec of data is carried from source to destination and from destination to user. When the coding length is 8bit, the findings show that 0.091kb/sec of data is required to transport data from source to destination. Each algorithm with the same bit code requires the same amount of bandwidth to convey data.


  1. Danan T, Surya SC, Rafael CN, Leila A. A platform for monitoring and sharing of generic health data in the cloudvol. 35. Future Generation Computer System; 2014. p. 102e13. Link
  2. Abubakar UO, Aisha YU, Maryam M, Hauwa A, Boukari S, Gital AY. Minimum search-time algorithm for image retrieval in cloud computing. Int J Intell Eng Syst 2021;15:596e606. Link
  3. Fiona HM, Christina C,Annemarie C, Jane S,Hugh S,MaryU. Evaluating mobile phone application for health behaviour change: a systematic review. J Telemed Telecare 2018;2:22e40. Link
  4. Andre B, Shane G, Jeffrey P. The persistence of broadband user behaviour: implications for universal services and competition policyvol. 43. Elsevier Telecommunications Policy; 2018. p. 1e27. Link
  5. Tatcha S, Hitoshi M. The Internet of Things as an accelerator of advancement of broadband networks: a case of Thailandvol. 42. Telecommunications Policy; 2018. p. 293e303. Link
  6. York E, Conley SN, Henriksen AD, Caserta D, Etka N, Harrington N, et al. Co-imagining the futures of implementation precision medicine using scenario analysis and design fiction. OMICS A J Integr Biol 2019;7:340e9. DOI
  7. Wang Y, Shrivastava A, Ryu J. Flash : randomized algorithms accelerated over CPU-GPU for ultra-high dimensional similarity search. 2017. p. 1e4. Link
  8. Salih BA, Wongthongtham P, Beheshti SMR, Zajabbari B. Towards a methodology for social business intelligence in the era of big social data incorporating trust and semantic analysis520. Lecture Notes in Electrical Engineering; 2019. p. 519e27. DOI
  9. Liu S, Wang Y, Wen A, Wang L, Hong N, Shen F, et al. CREATE: cohort retrieval enhanced by analysis of text from electronic health records using OMOPvol. 5; 2019. Common Data Model [Internet], Link.
  10. Merkys A, Vaitkus A, Chateigner D, Moeck P, Murray-rust P, Quiros M, et al. Crystallography open database : history, development, perspectives. 2019. p. 1e16 [Internet], Link.
  11. Tonello N, Tallada P, Serrano S, Carretero J, Eriksen M,Folger M, et al. The PAU Survey: operation and orchestration of multi-band survey datavol. 27. Astronomy and Computing; 2019. p. 171e88.
  12. Deepak P, Sahoo BPS, Sambit M, Satyabrata S. Cloud computing features, issues and challenges: a big picture. In: IEEE International Conference on Computational Intelligence and Networks; 2015. p. 116e23.
  13. Ryan S, Wang F, Wang H, Liu J. A deep investigation into network performance in virtual machine based cloud environments.In: IEEE international conference on Computer Communications; 2014. p. 1285e93.
  14. Buon K, Lau M, Jørgen BA, Gerhard K, Andreas FM.Impact of matching network on bandwidth of compact antenna arrays.In: IEEE Transactions on Antennas and Propagation.vol. 54; 2006. p. 3225e38.
  15. Li B, Yanyu H, Zheli L, Jin L, Zhihong T,Siu-Ming Y.HybridORAM: practical oblivious cloud storage with constant bandwidth. 2018.DOI
  16. Assabir A, Elmhamdi J, Hammouch A.Throughput enhancement of the edge user equipment based on the power- bandwidth tradeoff in the optical attocell networks.International Journal of Intelligent Engineering and Systems2020;13:337e55.
  17. McManus JP, Day TG, Mailloux ZJ.The effects of latency, bandwidth, and packet loss on cloud-based gaming services. 2019.Link.
  18. Keane MT, Kenny EM.How case-based reasoning explains neural networks.A theoretical analysis of xai using post-hoc explanation-by-example from a survey of ANN-CBR twinsystems.Lect Notes Comput Sci2019;11680:155e71.DOI
  19. Cai Q,Pan Y,Yao T,Yan C,Mei T.Memory matching networks for one-shot image recognition.In: IEEE Comput Soc Conf Comput Vis Pattern Recogn; 2018.p. 4080e8.DOI
  20. Lv Q,Josephson W,Wang Z,Charikar M,Li K.Multi-probeLSH: efficient indexing for high-dimensional similarity search.Proceedings of international conference on very large data bases. 2007.p. 950e61.Link.
  21. Dong W,Wang Z,Josephson W,CharikarM,Li K.Modelling LSH for performance tuning.In: Proceedings of the ACM conference on information and knowledge management; 2008.p. 669e78.Link.
  22. Abubakar UO, Boukari S, Abdulsalam YG, Hauwa A. Performance evaluation of geometric similarity preserving embedding-based hashing for big data in cloud computing. J Theo Appl Info Technol 2020;98:378e90.
  23. Oladunjoye JA, Moses T, Okpor J, Bako AR. Performance study of the memory utilization of an improved pattern matching algorithm using bit-parallelism. J Comp Sci Eng 2022;3:49e59.
  24. Boukari S, Abubakar UO, Abdulsalam YG, Iliya MA. Performance evaluation of geometric similarity preserving embedding based hashing. Global Scient J 2019;7:642e57.
  25. Ram KK, Arunav S, Rabul HL. Image authentication based on robust image hashing with geometric correction. J Multimdia Tool Appl 2017;7:25409e29.
  26. Yan C, Jielin J, Zhihui L, Zuojin H, Waikeun W. Supervised discrete discriminant hashing for image retrieval. Int Conf Pattern Recogn 2018;78:79e90.
  27. Guosheng L, Chunhua S, Anton VD. Supervised hashing using graph cuts and boosted decision trees. IEEE transactions on pattern analysis and machine intelligence 2015;37:2317e37. https://doi.org/10.1109/TPAMI.2015.2404776.
  28. Yueming L, Wing WY, Ziqian Z, Daneil SY, Patrick PK. Asymetric cyclcial hashing for large-scale-image retrieval. In: IEEE Transaction on Multimedia. vol. 17; 2015. p. 1225e35.
  29. Ye R, Xuelong L. Compact structure hashing via sparse and similarity embedding. IEEE Transactions on Cybernetics 2016;46:718e28.
  30. Heo JP, Youngwoon L, Junfeng H, Shih-Fu C, Sung-Eui Y, Hashing Spherical. Binary code embedding with hypersphere. In: IEEE Transaction on Pattern Analysis and Machine Intelligence; 2015. p. 1e14.
  31. Jingkuan S, He T, Lianli G, Xing X, Alan H, Heng ST. Binary generative adversarial networks for image retrieval. Proc AAAI Conf Artif Intell 2018;32:394e401.
  32. Charikar M, Paris S. Hashing_based-Estimators for kernel density in high dimensions. 2018. ar.xiv:1808.10530v1[cs.DS].
  33. Li X, Hu D, Nie F. Large Graph hashing with spectral rotation. In: Proc AAAI Conf Artif Intell. 31; 2017. p. 1e7. https://dtaoo.github.io/papers/2017_LGHSR.pdf.
  34. Junfeng H, Regunathan R, Shih-Fu F, Claus B. Compact hashing with joint optimization of search accuracy an time. 2011. p. 753e60 [Internet], https://citeseerx.ist.psu.edu/viewdoc/download?doi¼10.1.1.362.6675&rep¼rep1&type¼pdf.