IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0175500.html
   My bibliography  Save this article

A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol

Author

Listed:
  • Ping Zeng
  • Qingping Tan
  • Xiankai Meng
  • Zeming Shao
  • Qinzheng Xie
  • Ying Yan
  • Wei Cao
  • Jianjun Xu

Abstract

In this paper, based on our previous multi-pattern uniform resource locator (URL) binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can be applied to the fields of network security, data analysis, load balancing, cloud robotic communications, and so on—all of which require string matching from a fixed starting position. Our approach effectively solves the performance problems of the classical multi-pattern matching algorithms. This paper explores ways to improve string matching performance under the HTTP protocol by using a hash method combined with a binary method that transforms the symbol-space matching problem into a digital-space numerical-size comparison and hashing problem. The MH approach has a fast matching speed, requires little memory, performs better than both the classical algorithms and HEM for matching fields in an HTTP stream, and it has great promise for use in real-world applications.

Suggested Citation

  • Ping Zeng & Qingping Tan & Xiankai Meng & Zeming Shao & Qinzheng Xie & Ying Yan & Wei Cao & Jianjun Xu, 2017. "A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol," PLOS ONE, Public Library of Science, vol. 12(4), pages 1-21, April.
    • Handle: RePEc:plo:pone00:0175500
    DOI: 10.1371/journal.pone.0175500
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0175500
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0175500&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0175500?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0175500. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.