Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Fast text searching: allowing errors
Communications of the ACM
More efficient bottom-up multi-pattern matching in trees
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Text algorithms
Decision problems for patterns
Journal of Computer and System Sciences
Event detection from time series data
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
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
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
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
Algorithms and Theory of Computation Handbook
Algorithms and Theory of Computation Handbook
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
A Sequential Pattern Query Language for Supporting Instant Data Mining for e-Services
Proceedings of the 27th International Conference on Very Large Data Bases
SRQL: Sorted Relational Query Language
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
ATreeGrep: Approximate Searching in Unordered Trees
SSDBM '02 Proceedings of the 14th International Conference on Scientific and Statistical Database Management
Efficient Matching for Web-Based Publish/Subscribe Systems
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
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
The Problem of Context Sensitive String Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Finite Query Languages for Sequence Databases
DBLP-5 Proceedings of the Fifth International Workshop on Database Programming Languages
Expressing and optimizing sequence queries in database systems
ACM Transactions on Database Systems (TODS)
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
Efficient evaluation of parameterized pattern queries
Proceedings of the 14th ACM international conference on Information and knowledge management
Geoinformatica
On-line Aggregation and Filtering of Pattern-based Queries
SSDBM '06 Proceedings of the 18th International Conference on Scientific and Statistical Database Management
Tree pattern aggregation for scalable XML data dissemination
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
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
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Finding frequent sub-trajectories with time constraints
Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing
Efficient subsequence search in databases
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.01 |
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string made of constant symbols or variables where variables can be matched against any symbol of the input string. Parameterized patterns allow a concise and expressive definition of regular expressions that would be very complex to describe without variables. They can also be used to express additional constraints, to ''relax'' pattern expressions by allowing more freedom, and finally to cluster patterns in order to minimize the number of symbols' comparisons.