The Boyer Moore Galil string searching strategies revisited
SIAM Journal on Computing
Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Text algorithms
Parameterized pattern matching by Boyer-Moore-type algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
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
Shape-based retrieval of similar subsequences in time-series databases
Proceedings of the 2002 ACM symposium on Applied computing
Similarity based retrieval from sequence databases using automata as queries
Proceedings of the eleventh international conference on Information and knowledge management
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
SEQ: A Model for Sequence Databases
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
String Matching Algorithms and Automata
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
SRQL: Sorted Relational Query Language
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
On Similarity Queries for Time-Series Data: Constraint Specification and Implementation
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Expressing and optimizing sequence queries in database systems
ACM Transactions on Database Systems (TODS)
Multi-scale Classification of Moving Objects Trajectories
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
On mining webclick streams for path traversal patterns
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Mining, indexing, and querying historical spatiotemporal data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Geoinformatica
Query languages and data models for database sequences and data streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Data & Knowledge Engineering
Querying trajectories using flexible patterns
Proceedings of the 13th International Conference on Extending Database Technology
A generic data model for moving objects
Geoinformatica
Stream-Mode FPGA acceleration of complex pattern trajectory querying
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
Many applications rely on sequence databases and use extensively pattern-matching queries to retrieve data of interest. This paper extends the traditional pattern-matching expressions to parameterized patterns, featuring variables. Parameterized patterns are more expressive and allow to define concisely regular expressions that would be very complex to describe without variables. They can also be used to express additional constraints on patterns' variables.We show that they can be evaluated without additional cost with respect to traditional techniques (e.g., the Knuth-Morris-Pratt algorithm). We describe an algorithm that enjoys low memory and CPU time requirements, and provide experimental results which illustrate the gain of the optimized solution.