A Brief Overview of Dead-Zone Pattern Matching Algorithms

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

Abstract

Within the last decades, the dead-zone algorithms have emerged as being highly performant on certain types of data. Such algorithms solve the keyword exact matching problem over strings, though extensions to trees and two-dimensional data have also been devised. In this short paper, we give an overview of such algorithms.
Original languageEnglish
Title of host publicationArtificial Intelligence Applications and Innovations - AIAI 2019 IFIP WG 12.5 International Workshops
Subtitle of host publicationMHDW and 5G-PINE 2019, Proceedings
EditorsElias Pimenidis, Lazaros Iliadis, Ilias Maglogiannis, John MacIntyre
PublisherSpringer
Pages208-218
Number of pages10
Volume560
ISBN (Print)9783030199081
DOIs
Publication statusPublished - 15 May 2019

Publication series

NameIFIP Advances in Information and Communication Technology
Volume560
ISSN (Print)1868-4238

Fingerprint

Dive into the research topics of 'A Brief Overview of Dead-Zone Pattern Matching Algorithms'. Together they form a unique fingerprint.

Cite this