A fast string searching algorithm
Communications of the ACM
Optimization of sequence queries in database systems
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On computing correlated aggregates over continual data streams
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Continuous queries over data streams
ACM SIGMOD Record
IEEE Transactions on Knowledge and Data Engineering
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Towards Sensor Database Systems
MDM '01 Proceedings of the Second International Conference on Mobile Data Management
Tribeca: a system for managing large databases of network traffic
ATEC '98 Proceedings of the annual conference on USENIX Annual Technical Conference
Event analyzer: a tool for sequential data processing
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Detection of complex temporal patterns over data streams
Information Systems - Special issue: ADBIS 2002: Advances in databases and information systems
Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream
New Frontiers in Applied Data Mining
Intonation based sentence modality classifier for Czech using artificial neural network
NOLISP'11 Proceedings of the 5th international conference on Advances in nonlinear speech processing
| Hi-index | 0.00 |
A growing number of applications require support for processing data that is in the form of continuous stream, rather than finite stored data. In this paper we present a new approach for detecting temporal patterns with complex predicates over continuous data stream. Our algorithm efficiently scans the stream with a sliding window, and checks the data inside the window from right-to-left to see if they satisfy the pattern predicates. By first preprocessing the complex temporal patterns at compile time, it can exploit their predicates interdependency, and skip unnecessary checks with efficient window slides at run time. It resembles the sliding window process of the Boyer-Moore algorithm, although allowing complex predicates that are beyond the scope of this traditional string search algorithm. Some preliminary evaluation of our proposed algorithm shows its efficiency when compared to the naive approach.