Optimal search algorithm in a big database using interpolation–extrapolation method

Fast data search is an important element of big data in the modern era of internet of things, cloud computing, and social networks. Search using traditional binary-search algorithm can be accelerated by employing an interpolation search technique when the data is regularly distributed. In this work,...

Full description

Bibliographic Details
Main Authors:	Kabir, M. Nomani, Alginahi, Yasser M., Ali, J., Abdel-Raheem, E.
Format:	Article
Language:	English
Published:	IET 2019
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://umpir.ump.edu.my/id/eprint/25828/ http://umpir.ump.edu.my/id/eprint/25828/ http://umpir.ump.edu.my/id/eprint/25828/1/Optimal%20search%20algorithm%20in%20a%20big%20database%20using%20interpolation-extrapolation%20method.pdf

id	ump-25828
recordtype	eprints
spelling	ump-258282019-11-26T02:31:20Z http://umpir.ump.edu.my/id/eprint/25828/ Optimal search algorithm in a big database using interpolation–extrapolation method Kabir, M. Nomani Alginahi, Yasser M. Ali, J. Abdel-Raheem, E. QA75 Electronic computers. Computer science Fast data search is an important element of big data in the modern era of internet of things, cloud computing, and social networks. Search using traditional binary-search algorithm can be accelerated by employing an interpolation search technique when the data is regularly distributed. In this work, the interpolation search is investigated in which the search results provided unexpected sluggish progress during a search in a large database due to the irregular distribution of data. Irregular distribution of data does not allow the interpolation to make a good prediction about the location of the search item. To overcome this issue, an interpolation–extrapolation search (IES) method is proposed where the interpolation method is integrated with an extrapolation method that balances the lower and upper bounds of the search interval. The proposed method provides faster convergence property than the binary search and the interpolation method. Hence, the proposed IES method provides a faster search for items in a big database. IET 2019-10-17 Article PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/25828/1/Optimal%20search%20algorithm%20in%20a%20big%20database%20using%20interpolation-extrapolation%20method.pdf Kabir, M. Nomani and Alginahi, Yasser M. and Ali, J. and Abdel-Raheem, E. (2019) Optimal search algorithm in a big database using interpolation–extrapolation method. Electronics Letters, 55 (21). pp. 1130-1133. ISSN 0013-5194 https://doi.org/10.1049/el.2019.1965
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	QA75 Electronic computers. Computer science
spellingShingle	QA75 Electronic computers. Computer science Kabir, M. Nomani Alginahi, Yasser M. Ali, J. Abdel-Raheem, E. Optimal search algorithm in a big database using interpolation–extrapolation method
description	Fast data search is an important element of big data in the modern era of internet of things, cloud computing, and social networks. Search using traditional binary-search algorithm can be accelerated by employing an interpolation search technique when the data is regularly distributed. In this work, the interpolation search is investigated in which the search results provided unexpected sluggish progress during a search in a large database due to the irregular distribution of data. Irregular distribution of data does not allow the interpolation to make a good prediction about the location of the search item. To overcome this issue, an interpolation–extrapolation search (IES) method is proposed where the interpolation method is integrated with an extrapolation method that balances the lower and upper bounds of the search interval. The proposed method provides faster convergence property than the binary search and the interpolation method. Hence, the proposed IES method provides a faster search for items in a big database.
format	Article
author	Kabir, M. Nomani Alginahi, Yasser M. Ali, J. Abdel-Raheem, E.
author_facet	Kabir, M. Nomani Alginahi, Yasser M. Ali, J. Abdel-Raheem, E.
author_sort	Kabir, M. Nomani
title	Optimal search algorithm in a big database using interpolation–extrapolation method
title_short	Optimal search algorithm in a big database using interpolation–extrapolation method
title_full	Optimal search algorithm in a big database using interpolation–extrapolation method
title_fullStr	Optimal search algorithm in a big database using interpolation–extrapolation method
title_full_unstemmed	Optimal search algorithm in a big database using interpolation–extrapolation method
title_sort	optimal search algorithm in a big database using interpolation–extrapolation method
publisher	IET
publishDate	2019
url	http://umpir.ump.edu.my/id/eprint/25828/ http://umpir.ump.edu.my/id/eprint/25828/ http://umpir.ump.edu.my/id/eprint/25828/1/Optimal%20search%20algorithm%20in%20a%20big%20database%20using%20interpolation-extrapolation%20method.pdf
first_indexed	2023-09-18T22:39:53Z
last_indexed	2023-09-18T22:39:53Z
_version_	1777416843468734464

Optimal search algorithm in a big database using interpolation–extrapolation method

Similar Items