Skip to main content

Searching Process Using Boyer Moore Algorithm in Digital Library

  • Conference paper
  • First Online:
Intelligent Computing and Optimization (ICO 2020)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1324))

Included in the following conference series:

  • 1035 Accesses

Abstract

Reading helps to learn more vocabularies and their usages. People should read books to get knowledge. Nowadays, digital libraries are used to search for various books. If the internet connection is available, digital libraries can be accessed easily via computers, laptops, and mobile phones. Students and readers can search for the desired books from this digital library by typing sub-strings of a book title that matches with parts of the original book title. To be able to make such a searching process effectively, string searching algorithms can be applied. There are many sophisticated and efficient algorithms for string searching. In this paper, a Boyer Moore (BM) string-searching algorithm is applied to search the desired books effectively in the digital library. And then the BM algorithm is presented by comparing it with Horspool’s algorithm to prove the performance efficiency of the BM algorithm for the searching process.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Rawan, A.A.: An algorithm for string searching. In: International Journal of Computer Applications, vol. 177, no: 10, pp. 0975–8887 (2019)

    Google Scholar 

  2. Anany, L.: Introduction to the Design and Analysis of Algorithms. Villanova University, Philadelphia (2012)

    Google Scholar 

  3. Robert, S., Kevin, W.: Algorithms. Princeton University, Princeton (2011)

    Google Scholar 

  4. Bi, K., Gu, N.J., Tu, K., Liu, X.H., Liu, G.: A practical distributed string-matching algorithm architecture and implementation. In: Proceedings of World Academy Of Science, Engineering and Technology, vol. 1, no: 10, pp. 3261–3265 (2007)

    Google Scholar 

  5. Robert, S.B., Strother, M.J.: A fast string searching algorithm. Assoc. Comput. Mach., 20(10), 762–772 (1977)

    Google Scholar 

  6. Abdulellah, A.A., Abdullah, H.A., Abdulatif, M.A.: Analysis of parallel Boyer-Moore string search algorithm. Glob. J. Comput. Sci. Technol. Hardware Compu. 13, 43–47 (2013)

    Google Scholar 

  7. Ain, Z.M.S., Nur, A.R., Alya, G.B., Kamarularifin, A.J., Fakariah, H.M.A., Teh, F.A.R.: A method for web application vulnerabilities detection by using Boyer-Moore string matching algorithm. In: 3rd Information Systems International Conference, vol. 72, pp. 112–121 (2015)

    Google Scholar 

  8. Rizky, I.D., Anif, H.S., Arini, A.: Implementasi Algoritma Boyer Moore Pada Aplikasi Kamus Istilah Kebidanan Berbasis Web. Query: J. Inf. Syst. 2, 53–62 (2018)

    Google Scholar 

  9. Ayu, P.S., Mesran, M.: Implementasi algoritma boyer moore pada aplikasi kamus nama bayi beserta maknanya berbasis android. Pelita informatika: informasi dan informatika 17, 97–101 (2018)

    Google Scholar 

  10. Bruce, W.W., Richard, E.W.: A Boyer-Moore-style algorithm for regular expression pattern matching. Sci. Comput. Program. 48, 99–117 (2003)

    Article  Google Scholar 

  11. Pandiselvam, P., Marimuthu, T, Lawrance. R.: A comparative study on string matching algorithm of biological sequences. In: International Conference on Intelligent Computing (2014)

    Google Scholar 

  12. DU, V.: A comparative analysis of various string-matching algorithms. In: 8th International Research Conference, KDU (2015)

    Google Scholar 

  13. Robbi, R., Ansari, S.A., Ayu, P.A., Dicky, N.: Visual approach of searching process using Boyer-Moore algorithm. In: Journal of Physics, vol. 930 (2017)

    Google Scholar 

  14. Mulyati, I.A.: Searching process using Bayer Moore algorithm in medical information media. In: International Journal of Recent Technology and Engineering (IJRTE), vol. 8 (2019)

    Google Scholar 

  15. Michael, T.G., Roberto T.: Algorithm Design and Applications. John Wiley and Sons, Hoboken (2015)

    Google Scholar 

  16. Abd, M.A., Zeki, A., Zamani, M., Chuprat, S., El-Qawasmeh, E. (eds.): Informatics Engineering and Information Science. New York (2011)

    Google Scholar 

  17. Yi, C.L.: A survey of software-based string matching algorithms for forensic analysis. In: Annual ADFSL Conference on Digital Forensics, Security and Law (2015)

    Google Scholar 

Download references

Acknowledgments

We are appreciative of the advisors from the University of Information Technology who gave us valuable remarks and suggestions all through this project.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Laet Laet Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lin, L.L., Soe, M.T. (2021). Searching Process Using Boyer Moore Algorithm in Digital Library. In: Vasant, P., Zelinka, I., Weber, GW. (eds) Intelligent Computing and Optimization. ICO 2020. Advances in Intelligent Systems and Computing, vol 1324. Springer, Cham. https://doi.org/10.1007/978-3-030-68154-8_50

Download citation

Publish with us

Policies and ethics