Sequential and Recursive Structure Searching Algorithms for Arabic and English Texts

Abstract

The Holy Quran is a central religious book of Islam that is followed by all Muslims throughout the world. Recently, digital Quran indexing has helped Muslims in the entire world to search for specific content and index in the Quran. There are many methods of the searching amount of data to find one particular piece of information such as finding a specific word or a sentence in the Holy Quran. The search may proceed consecutively in every element until the query is found or recursively traverse the tree data structure but yet in a linear manner. This study is set to compare the performance of two searching techniques-sequential search as well as B+Tree search algorithms. A comparison analysis is conducted using two languages, which is Arabic from the Quran verses along with the English translation of each verse. The experimental result revealed that after the average times for each searching algorithm has been recorded, the sequential search required a lot of time during the search process, while B+Tree produced a significantly low retrieving time, which were 34ms and 1ms respectively. This can be concluded that B+Tree performed faster searching than sequential methods. In the future, it is hoped that more searching algorithms are open for testing with this dataset such using linked list.