Approximate string matching for large-scale event processing

Satoshi Kuboi, Kensuke Baba, Shigeru Takano, Kazuaki Murakami

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Event processing is an important technology to detect what happened in the real world from a large amount of sensor data. This article is trying to find a suitable method for event processing with huge data. The authors formalize event processing as a problem of approximate string matching and evaluate the processing time of the two algorithms for the problem, the shift-Add algorithm and the FFT-based algorithm. The shift-Add algorithm is efficient for matching with a short string, however the processing time is proportional to the length of the string. On the other hand, the processing time of the FFT-based algorithm depends on the logarithm of the length of the string. Their experimental result with a common computer shows that the FFT-based algorithm is faster than the shift-Add algorithm for a string longer than about 4,000.

    Original languageEnglish
    Title of host publicationProceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014
    EditorsElyas Palantei
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages141-144
    Number of pages4
    ISBN (Electronic)9781479967261
    DOIs
    Publication statusPublished - Mar 24 2014
    Event2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014 - Makassar, Indonesia
    Duration: Nov 26 2014Nov 30 2014

    Publication series

    NameProceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014

    Other

    Other2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014
    CountryIndonesia
    CityMakassar
    Period11/26/1411/30/14

    Fingerprint

    Processing
    Fast Fourier transforms
    Sensors

    All Science Journal Classification (ASJC) codes

    • Computer Networks and Communications
    • Computer Science Applications
    • Electrical and Electronic Engineering

    Cite this

    Kuboi, S., Baba, K., Takano, S., & Murakami, K. (2014). Approximate string matching for large-scale event processing. In E. Palantei (Ed.), Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014 (pp. 141-144). [7067327] (Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/MICEEI.2014.7067327

    Approximate string matching for large-scale event processing. / Kuboi, Satoshi; Baba, Kensuke; Takano, Shigeru; Murakami, Kazuaki.

    Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014. ed. / Elyas Palantei. Institute of Electrical and Electronics Engineers Inc., 2014. p. 141-144 7067327 (Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Kuboi, S, Baba, K, Takano, S & Murakami, K 2014, Approximate string matching for large-scale event processing. in E Palantei (ed.), Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014., 7067327, Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014, Institute of Electrical and Electronics Engineers Inc., pp. 141-144, 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014, Makassar, Indonesia, 11/26/14. https://doi.org/10.1109/MICEEI.2014.7067327
    Kuboi S, Baba K, Takano S, Murakami K. Approximate string matching for large-scale event processing. In Palantei E, editor, Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 141-144. 7067327. (Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014). https://doi.org/10.1109/MICEEI.2014.7067327
    Kuboi, Satoshi ; Baba, Kensuke ; Takano, Shigeru ; Murakami, Kazuaki. / Approximate string matching for large-scale event processing. Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014. editor / Elyas Palantei. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 141-144 (Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014).
    @inproceedings{dbf78d90427645dcb137da73c6981b1e,
    title = "Approximate string matching for large-scale event processing",
    abstract = "Event processing is an important technology to detect what happened in the real world from a large amount of sensor data. This article is trying to find a suitable method for event processing with huge data. The authors formalize event processing as a problem of approximate string matching and evaluate the processing time of the two algorithms for the problem, the shift-Add algorithm and the FFT-based algorithm. The shift-Add algorithm is efficient for matching with a short string, however the processing time is proportional to the length of the string. On the other hand, the processing time of the FFT-based algorithm depends on the logarithm of the length of the string. Their experimental result with a common computer shows that the FFT-based algorithm is faster than the shift-Add algorithm for a string longer than about 4,000.",
    author = "Satoshi Kuboi and Kensuke Baba and Shigeru Takano and Kazuaki Murakami",
    year = "2014",
    month = "3",
    day = "24",
    doi = "10.1109/MICEEI.2014.7067327",
    language = "English",
    series = "Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    pages = "141--144",
    editor = "Elyas Palantei",
    booktitle = "Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014",
    address = "United States",

    }

    TY - GEN

    T1 - Approximate string matching for large-scale event processing

    AU - Kuboi, Satoshi

    AU - Baba, Kensuke

    AU - Takano, Shigeru

    AU - Murakami, Kazuaki

    PY - 2014/3/24

    Y1 - 2014/3/24

    N2 - Event processing is an important technology to detect what happened in the real world from a large amount of sensor data. This article is trying to find a suitable method for event processing with huge data. The authors formalize event processing as a problem of approximate string matching and evaluate the processing time of the two algorithms for the problem, the shift-Add algorithm and the FFT-based algorithm. The shift-Add algorithm is efficient for matching with a short string, however the processing time is proportional to the length of the string. On the other hand, the processing time of the FFT-based algorithm depends on the logarithm of the length of the string. Their experimental result with a common computer shows that the FFT-based algorithm is faster than the shift-Add algorithm for a string longer than about 4,000.

    AB - Event processing is an important technology to detect what happened in the real world from a large amount of sensor data. This article is trying to find a suitable method for event processing with huge data. The authors formalize event processing as a problem of approximate string matching and evaluate the processing time of the two algorithms for the problem, the shift-Add algorithm and the FFT-based algorithm. The shift-Add algorithm is efficient for matching with a short string, however the processing time is proportional to the length of the string. On the other hand, the processing time of the FFT-based algorithm depends on the logarithm of the length of the string. Their experimental result with a common computer shows that the FFT-based algorithm is faster than the shift-Add algorithm for a string longer than about 4,000.

    UR - http://www.scopus.com/inward/record.url?scp=84946687785&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84946687785&partnerID=8YFLogxK

    U2 - 10.1109/MICEEI.2014.7067327

    DO - 10.1109/MICEEI.2014.7067327

    M3 - Conference contribution

    T3 - Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014

    SP - 141

    EP - 144

    BT - Proceeding - 2014 Makassar International Conference on Electrical Engineering and Informatics, MICEEI 2014

    A2 - Palantei, Elyas

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -