Efficient evaluation of parameterized pattern queries

Cédric du Mouza, Philippe Rigaux, Michel Scholl
2005 Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05  
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
more » ... thout 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.
doi:10.1145/1099554.1099731 dblp:conf/cikm/MouzaRS05 fatcat:uke3hft4inggpedlkbamr7ic2y