Streaming Pattern Matching

Streaming Pattern Matching is a computational framework within streaming algorithms that enables the detection of specified patterns in a data stream through sequential, single-pass processing with limited memory, distinguishing it from batch-based pattern matching methods by its emphasis on real-time, incremental analysis under temporal and spatial constraints.

29

Publications

1.1K

Citations

86

Authors

43

Institutions

Publications per year

2017–2026

8

Authors

86

  1. EP
    Ely Porat

    Bar-Ilan University, Israel

    5 publications · 141 citations

    5

    h-index

  2. SG
    Shay Golan

    Bar-Ilan University, Israel

    2 publications · 23 citations

    2

    h-index

  3. RC
    Raphaël Clifford

    University of Bristol, United Kingdom

    2 publications · 35 citations

    2

    h-index

  4. AP
    Ami Paz

    Technion – Israel Institute of Technology, Israel

    2 publications · 48 citations

    2

    h-index

  5. BS
    Benjamin Sach

    University of Bristol, United Kingdom

    2 publications · 39 citations

    2

    h-index

1–5 of 86

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 4 publications · 56 citations

    4

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 3 publications · 93 citations

    3

    h-index

  3. ACM Transactions on Algorithms

    TALG · 1 publications · 22 citations

    1

    h-index

  4. AI Magazine

    1 publications · 27 citations

    1

    h-index

  5. Information Sciences

    1 publications · 26 citations

    1

    h-index

1–5