Scalable complex pattern search in sequential data

Authors:
Leila Kaghazian;Dennis McLeod;Reza Sadri
Affiliations:
USC, Los Angeles, CA, USA;USC, Los Angeles, CA, USA;Digital Spectrum Solutions Inc., Irvine, CA, USA
Venue:
Proceedings of the 17th ACM conference on Information and knowledge management
Year:
2008

Citing 1
Cited 1

Optimization of sequence queries in database systems

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

From regular expressions to nested words: unifying languages and query execution for relational and XML sequences

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 which exploits the inter-dependencies between the elements of a sequential pattern to minimize repeated passes over the same data. Performance gains derived experimental results show impressive speedup up to 100 times.