Abstract
Problem statement: Searching text materials is the one of the most im portant operations that carried out by search engines either on web or desktop applications, searching algorithms are required sometimes to find a specific word into a t ext, others to find a multi word term (pattern matching) into a text. Searching for term into a th esaurus database can be carried out using many searching algorithm such as brute-force algorithm a nd others. Approach: We addressed several issues concerning developing a searching algorithm that se arch terms into thesaurus database. Two exact algorithms were discussed and compared. The first a lgorithm, brute-force algorithm and the second one were proposed by this study to enhance brute-force algorithm. Results: We proposed an efficient search algorithm and compare it with brute force technique . Computational results showed that our algorithm can provide an efficient search algorithm that redu ces the number of queries and the total time requir ed to finish the required task. Conclusion: Our study showed an optimum solution for larger si ze of the studied problem with much less processing time than the brute-force algorithm. The modified algorithm has a higher efficiency to deal with Thes aurus Database searching problems.
Highlights
Our objective is to introduce an efficient search algorithm within the thesaurus database; this search algorithm can be used in either indexing or information retrieval applications
The Sections are an overview over the problems we address, Brute-force algorithm and our enhanced algorithm First Token (FT) Algorithm
The proposed approach-First Token (FT): In this study we proposed an enhanced algorithm to Bruteforce algorithm called (FT)
Summary
Data within documents, relational databases, Schemas and WWW are the main sources where information can be retrieved. Text search is applicable in e-business, human resources departments and others It is a basic supported feature in any word processing application such as Microsoft Word or database engines like Oracle (Doug et al, 2011), MySQL and SqlServer. Searching about text into a thesaurus database or any other data sources require the traversing of each term or compound term of the text. Our objective is to introduce an efficient search algorithm within the thesaurus database; this search algorithm can be used in either indexing or information retrieval applications. Searching for text in database or any (single-word or multi-word) in a given domain of other data source based on string searching algorithms
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
