Automaton-Based Sublinear Keyword Pattern Matching
We show how automaton-based sublinear keyword pattern matching (skpm) algorithms appearing in the literature can be seen as different instantiations of a general automaton-based skpm algorithm skeleton. Such algorithms use finite automata (FA) for efficient computation of string membership in a certain language. The algorithms were formally derived as part of a new skpm algorithm taxonomy, based on an earlier suffix-based skpm algorithm taxonomy . Such a taxonomy is based on deriving the algorithms from a common starting point by successively adding algorithm and problem details and has a number of advantages. It provides correctness arguments, clarifies the working of the algorithms and their interrelationships, helps in implementing the algorithms, and may lead to new algorithms being discovered by finding gaps in the taxonomy. We show how to arrive at the general algorithm skeleton and derive some instantiations, leading to well-known factor- and factor oracle-based algorithms. In doing so, we show the shift functions used for them can be (strengthenings of) shift functions used for suffix-based algorithms. This also results in a number of previously undescribed factor-based skpm algorithm variants, whose performance remains to be investigated.
KeywordsPattern Match Shift Function Garbage Collection Algorithm Detail Input String
Unable to display preview. Download preview PDF.
- 2.Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. PhD thesis, Faculty of Computing Science, Technische Universiteit Eindhoven (1995)Google Scholar
- 7.Allauzen, C., Raffinot, M.: Oracle des facteurs d’un ensemble de mots. Technical Report 99-11, Institut Gaspard-Monge, Université de Marne-la-Vallée (1999)Google Scholar
- 8.Cleophas, L.G.: Towards SPARE Time: A New Taxonomy and Toolkit of Keyword Pattern Matching Algorithms. Master’s thesis, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven (2003)Google Scholar
- 9.Cleophas, L., Watson, B.W., Zwaan, G.: A new taxonomy of sublinear keyword pattern matching algorithms. Technical Report 04/07, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven (2004)Google Scholar
- 11.Jonkers, H.: Abstraction, specification and implementation techniques, with an application to garbage collection. Technical Report 166, Mathematisch Centrum, Amsterdam (1983)Google Scholar
- 12.Watson, B.W.: Constructing minimal acyclic deterministic finite automata. PhD thesis, Department of Computer Science, University of Pretoria (2004)Google Scholar
- 13.Barla-Szabo, G.: A taxonomy of graph representations. Master’s thesis, Department of Computer Science, University of Pretoria (2002)Google Scholar
- 16.van den Eijnde, J.: Program derivation in acyclic graphs and related problems. Technical Report 92/04, Faculty of Computing Science, Technische Universiteit Eindhoven (1992)Google Scholar
- 17.Watson, B.W.: A new family of Commentz-Walter-style multiple-keyword pattern matching algorithms. In: Proceedings of the Prague Stringology Club Workshop 2000, Department of Computer Science and Engineering, pp. 71–76. Czech Technical University, Prague (2000)Google Scholar
- 19.Cleophas, L., Zwaan, G., Watson, B.W.: Constructing Factor Oracles. In: Proceedings of the Prague Stringology Conference 2003, Department of Computer Science and Engineering, Czech Technical University, Prague (2003)Google Scholar