Scalable complex pattern search in sequential data

Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design and optimization of constructs that enable SQL to express complex patterns. In particular we propose the RSPS (recursive sequential pattern search) algorithm that inspired by the KMP (Knuth-Morris-Pratt) string matching algorithm and exploits the inter-dependencies between the elements of a sequential pattern to minimize repeated passes over the same data. Performance gains derived from a set of experiments and a sensitivity analysis for the RSPS are also discussed. Our experimental results demonstrate impressive speedup.

• Type: Conference
• Year: 2008
• Where: CIKM
• Authors: Leila Kaghazian, Dennis McLeod, Reza Sadri
• Keywords: CIKM 2008, Information Management, Sequential Pattern, Sequential Pattern Search, String Matching Algorithm