UMP Institutional Repository

Towards optimal search: a modified secant method for efficient search in a big database

M. Nomani, Kabir and Ali, Jahan and Alginahi, Yasser M. and Benseghir, Hocine (2018) Towards optimal search: a modified secant method for efficient search in a big database. In: IEEE 2nd Borneo International Conference On Applied Mathematics And Engineering (BICAME) 2018, 10 -11 November 2018 , Balikpapan, Indonesia. pp. 1-4.. (Unpublished)

[img]
Preview
Pdf
39.1 Towards optimal search a modified secant method.pdf

Download (87kB) | Preview

Abstract

Search techniques are integral part for text authentication and plagiarism checks. In this work, our aim is to develop an efficient search algorithm for Arabic texts in a big database. The database contains the authentic source of information where information is ordered; thus the efficient algorithm can be used for searching the texts. Our search algorithm uses a quasi-Newton method -Secant method instead of traditional binary search. The secant method has much faster convergence property than the binary search and hence the algorithm can find the specific texts in a shorter time period.

Item Type: Conference or Workshop Item (Lecture)
Uncontrolled Keywords: binary search; interpolation search; text search; quasi-Newton method; Secant method
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty/Division: Faculty of Computer System And Software Engineering
Institute of Postgraduate Studies
Depositing User: Pn. Hazlinda Abd Rahman
Date Deposited: 16 Oct 2019 03:26
Last Modified: 02 Mar 2020 02:57
URI: http://umpir.ump.edu.my/id/eprint/24503
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item