Skip to main content
Springer Nature Link
Log in

Performance Comparison of Distributed Pattern Matching Algorithms on Hadoop MapReduce Framework

  • Conference paper
  • First Online:
Mobile Networks and Management (MONAMI 2017)

Included in the following conference series:

  • 1050 Accesses

Abstract

Creating meaning out of the growing Big Data is an insurmountable challenge data scientists face and pattern matching algorithms are great means to create such meaning from heaps of data. However, the available pattern matching algorithms are mostly tested with linear programming models whose adaptability and efficiency are not tested in distributed programming models such as Hadoop MapReduce, which supports Big Data. This paper explains an experience of parallelizing three of such pattern matching algorithms, namely - Knuth Morris Pratt Algorithm (KMP), Boyer Moore Algorithm (BM) and a lesser known Franek Jennings Smyth (FJS) Algorithm and porting them to Hadoop MapReduce framework. All the three algorithms are converted to MapReduce programs using key value pairs and experimented on single node as well as cluster Hadoop environment. The result analysis with the Project Gutenberg data-set has shown all the three parallel algorithms scale well on Hadoop environment as the data size increases. The experimental results prove that KMP algorithm gives higher performance for shorter patterns over BM, and BM algorithm gives higher performance than KMP for longer patterns. However, FJS algorithm, which is a hybrid of KMP and Boyer horspool algorithm which is advanced version of BM, outperforms both KMP and BM for shorter and longer patterns, and emerges as the most suitable algorithm for pattern matching in a Hadoop environment.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Project gutenberg. https://www.gutenberg.org/

  2. Ramya, A., Sivasankar, E.: Distributed pattern matching and document analysis on big data using Hadoop MapReduce model. In: International Conference on Parallel and Distributed Grid Computing (2014)

    Google Scholar 

  3. Al-Mazroi, A.A., Rashid, N.A.A.: A fast hybrid algorithm for the exact string matching problem. Am. J. Eng. Appl. Sci. 4(1), 102–107 (2011)

    Article  Google Scholar 

  4. Boyer, R.S.: A fast string searching algorithm. Commun. Assoc. Comput. Mach. 20, 762–772 (1977)

    MATH  Google Scholar 

  5. Finnegan, M.: Boeing 787s to create half a terabyte of data per flight, says Virgin Atlantic. http://www.computerworlduk.com/data/. Accessed 12 Sep 2017

  6. Hume, A., Sunday, D.: Fast string searching. Softw.: Pract. Exp. 21(11), 1221–1248 (1991)

    Google Scholar 

  7. Al-Khamaiseh, K., ALShagarin, S.: A survey of string matching algorithms. Int. J. Eng. Res. Appl. 4, 144–156 (2014). ISSN 2248–9622

    Google Scholar 

  8. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6, 323–350 (1977)

    Article  MathSciNet  Google Scholar 

  9. Kofahi, N., Abusalama, A.: A framework for distributed pattern matching based on multithreading. Int. Arab J. Inf. Technol. 9(1), 30–38 (2012)

    Google Scholar 

  10. Cao, P., Wu, S.: Parallel research on KMP algorithm. In: International Conference on Consumer Electronics, Communications and Networks (CECNet) (2011)

    Google Scholar 

  11. Diwate, M.R.B., Alaspurkar, S.J.: Study of different algorithms for pattern matching. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 3, 1–8 (2013). ISSN 2277 128X

    Google Scholar 

  12. Rajesh, S., Prathima, S., Reddy, L.S.S.: Unusual pattern detection in DNA database using KMP algorithm. Int. J. Comput. Appl. 1(22), 1–5 (2010)

    Google Scholar 

  13. Singh, S., Singh, N.: Big data analytics. In: 2012 International Conference on Communication, Information and Computing Technology (ICCICT), 13230053, IEEE, October 2012

    Google Scholar 

  14. Singh, A.: New York stock exchange oracle exadata - our journey. http://www.oracle.com/technetwork/database/availability/index.html. Accessed 12 Sep 2017

  15. Sardjono, T.A., Al Kindhi, B.: Pattern matching performance comparisons as big data analysis recommendations for hepatitis C virus (HCV) sequence DNA. In: International Conference on Artificial Intelligence, Modelling and Simulation (AIMS) (2015). ISBN 978-1-4673-8675-3

    Google Scholar 

  16. Alzoabi, U.S., Alosaimi, N.M., Bedaiwi, A.S.: Parallelization of KMP string matching algorithm. In: World Congress on Computer and Information Technology (WCCIT). INSPEC Accession Number: 13826319 (2013)

    Google Scholar 

  17. Vance, A.: Hadoop, a free software program, finds uses beyond search, March 2009. http://www.nytimes.com/2009/03/17/technology/business-computing/17cloud.html

  18. Vidanagama, D.: A comparative analysis of various string matching algorithms. In: International Research Conference, pp. 54–60 (2015)

    Google Scholar 

  19. Franek, F., Jennings, C.G., Smyth, W.F.: A simple fast hybrid pattern-matching algorithm. J. Discrete Algorithms 5, 682–695 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

This work was completed successfully using the infrastructure support provided by Śúnya Labs, Rajagiri School of Engineering and Technology, India.

Author information

Authors and Affiliations

  1. Śúnya Labs, Rajagiri School of Engineering and Technology, Kochi, India

    C. P. Sona & Jaison Paul Mulerikkal

Authors
  1. C. P. Sona
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaison Paul Mulerikkal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to C. P. Sona .

Editor information

Editors and Affiliations

  1. SEIT, UNSW Canberra, Canberra, Australia

    Jiankun Hu

  2. RMIT University, Melbourne, Victoria, Australia

    Ibrahim Khalil

  3. RMIT University, Melbourne, Victoria, Australia

    Zahir Tari

  4. Swinburne University of Technology, Hawthorne, Melbourne, Victoria, Australia

    Sheng Wen

Rights and permissions

Reprints and permissions

Copyright information

© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sona, C.P., Mulerikkal, J.P. (2018). Performance Comparison of Distributed Pattern Matching Algorithms on Hadoop MapReduce Framework. In: Hu, J., Khalil, I., Tari, Z., Wen, S. (eds) Mobile Networks and Management. MONAMI 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 235. Springer, Cham. https://doi.org/10.1007/978-3-319-90775-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-90775-8_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-90774-1

  • Online ISBN: 978-3-319-90775-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation