Boyer-Moore Horspool Algorithm Used in Content Management System of Data Fast Searching
| Autor: | Ameedeen M. A., Chung Hoong Chan |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Health (social science)
General Computer Science 010308 nuclear & particles physics Computer science Boyer–Moore–Horspool algorithm General Mathematics General Engineering Commentz-Walter algorithm computer.software_genre 01 natural sciences Data type Education Term (time) Set (abstract data type) General Energy Search algorithm 0103 physical sciences Data mining State (computer science) computer General Environmental Science FSA-Red Algorithm |
| Zdroj: | Advanced Science Letters. 23:11387-11390 |
| ISSN: | 1936-6612 |
| DOI: | 10.1166/asl.2017.10289 |
| Popis: | After a deep view on few fast searching algorithm as Boyer-Moore algorithm, Boyer-Moore Horspool algorithm, Brute-Force Algorithm, Knuth-Morris-Pratt algorithm and Rabin-Karp algorithm, this research paper chooses Boyer-Moore Horspool algorithm to used in the content management system in term of data Fast Searching. An enormous amount of data stored in content management system as few big module as product data, slider data, personal information data, company information data, account data and another kind of data may refer to the different type of content management system and developer set. However, search specific data from all the above data type that mention, memory, and time consumed is used up. Therefore, from this paper, Boyer-Moore Horspool Algorithm is being chosen to use in content management system after comparing a few searching algorithm in research which will state in this article. The aim of this paper is to analysis few searching algorithm and choose the most suit algorithm that giving the fastest searching time consumed while searching long string data. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|