Parameterized pattern queries

Data and Knowledge Engineering

Volumn 63, Issue 2, 2007, Pages 433-456

  du Mouza, Cédric ^a   Rigaux, Philippe ^b   Scholl, Michel ^a  

^a Bioinformatique et Chimie Moléculaire   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Optimization; Pattern matching; Representation and manipulation of data

Indexed keywords

CLUSTER PATTERNS; DATA MANIPULATION;

CODES (SYMBOLS); CONSTRAINT THEORY; PARAMETERIZATION; PATTERN MATCHING;

QUERY LANGUAGES;

EID: 34447292140     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2007.03.005     Document Type: Article

References (42)

1. R. Agrawal, R. Srikant, Mining sequential patterns, in: Proc. IEEE Intl. Conf. on Data Engineering (ICDE), 1995, pp. 3-14.
2. P. Seshadri, M. Livny, R. Ramakrishnan, SEQ: a model for sequence databases, in: Proc. IEEE Intl. Conf. on Data Engineering (ICDE), 1995, pp. 232-239.
3. G. Mecca, A.J. Bonner, Finite query languages for sequence databases, in: Proc. Intl. Workshop on Database Programming Languages, 1995.
4. R. Sadri, C. Zaniolo, A.M. Zarkesh, J. Adibi, Optimization of sequence queries in database systems, in: Proc. ACM Symp. on Principles of Database Systems (PODS), 2001.
5. A.P. Sistla, T. Hu, V. Chowdhry, Similarity based retrieval from sequence databases using automata as queries, in: Proc. Intl. Conf. on Information and Knowledge Management (CIKM), 2002, pp. 237-244.
6. Boyer R.S., and Moore J.S. A fast string searching algorithm. Commun. ACM 20 10 (1977) 762-772
7. Knuth D., Morris J., and Pratt V. Fast pattern matching in strings. SIAM J. Comput. 6 2 (1977) 323-350
8. Crochemore M., and Rytter W. Text Algorithms (1994), Oxford University Press
9. J. Pereira, F. Fabret, F. Llirbat, D. Shasha, Efficient matching for Web-based publish/subscribe systems, in: Proc. Intl. Conf. on Cooperative Information Systems (CoopIS), 2000, pp. 162-173.
10. S. Madden, M.A. Shah, J.M. Hellerstein, V. Raman, Continuously adaptive continuous queries over streams, in: Proc. ACM SIGMOD Symp. on the Management of Data (SIGMOD), 2002. url .
11. C. du Mouza, P. Rigaux, M. Scholl, Efficient evaluation of parameterized pattern queries, in: Proc. Intl. Conf. on Information and Knowledge Management (CIKM), 2005, pp. 728-735.
12. C. du Mouza, P. Rigaux, M. Scholl, On-line aggregation and filtering of pattern-based queries, in: Proc. Intl. Conf. on Scientific and Statistical Databases (SSDBM), 2006.
13. Mount D.W. Bioinformatics Sequence and Genome Analysis. second ed. (2004), CSHL Press
14. C.I. Ezeife, M. Chen, Mining Web sequential patterns incrementally with revised PLWAP tree, in: Proc. Intl. Conf. on Web-Age Information Management (WAIM), 2004, pp. 539-548.
15. H.-F. Li, S.-Y. Lee, M.-K. Shan, On mining Webclick streams for path traversal patterns, in: WWW (Alternate Track Papers &Posters), 2004, pp. 404-405.
16. N. Mamoulis, H. Cao, G. Kollios, M. Hadjieleftheriou, Y. Tao, D.W. Cheung, Mining, indexing, and querying historical spatiotemporal data, in: Proc. Intl. Conf. on Knowledge Discovery and Data Mining (SIGKDD), 2004, pp. 236-245.
17. Aho A.V., Garey M.R., and Ullman J.D. The transitive reduction of a directed graph. SIAM Soc. Indus. Appl. Math. 1 (1972) 131-137
18. In: Atallah M.J., and Fox S. (Eds). Algorithms and Theory of Computation Handbook (1998), CRC Press Inc
19. Carnegie Institution of Washington - Department of Plant Biology, .
20. Ramakrishnan R., Donjerkovic D., Ranganathan A., Beyer K.S., and Krishnaprasad M. SRQL: sorted relational query language. Proc. Intl. Conf. on Scientific and Statistical Databases (SSDBM) (1998), IEEE Computer Society 84-95
21. R. Sadri, C. Zaniolo, A.M. Zarkesh, J. Adibi, A sequential pattern query language for supporting instant data mining for e-services, in: Proc. Intl. Conf. on Very Large Data Bases (VLDB), 2001.
22. Sadri R., Zaniolo C., Zarkesh A., and Adibi J. Expressing and optimizing sequence queries in database systems. ACM Trans. Database Syst. 29 2 (2004)
23. S.-W. Kim, J. Yoon, S. Park, T.-H. Kim, Shape-based retrieval of similar subsequences in time-series databases, in: Proc. ACM Symposium on Applied Computing, 2002, pp. 438-445.
24. D.Q. Goldin, P.C. Kanellakis, On similarity queries for time-series data: constraint specification and implementation, in: Proc. Intl. Conf. on Principles and Practice of Constraint Programming (CP'95), 1995.
25. V. Guralnik, J. Srivastava, Event detection from time series data, in: Proc. Intl. Conf. on Knowledge Discovery and Data Mining (SIGKDD), 1999, pp. 33-42.
26. L. Chen, R.T. Ng, On the marriage of Lp-norms and edit distance, in: Proc. Intl. Conf. on Very Large Data Bases (VLDB), 2004, pp. 792-803.
27. Y.-N. Law, H. Wang, C. Zaniolo, Query languages and data models for database sequences and data streams, in: Proc. Intl. Conf. on Very Large Data Bases (VLDB), 2004, pp. 492-503.
28. Ukkonen E. Finding approximate patterns in strings. J. Algorithms 6 1 (1985) 132-137
29. Landau G.M., and Vishkin U. Fast string matching with k differences. J. Comput. Syst. Sci. 37 1 (1988) 63-78
30. Wu S., and Manber U. Fast text searching allowing errors. Commun. ACM 35 10 (1992) 83-91
31. Navarro G. A guided tour to approximate string matching. ACM Comput. Surveys 33 1 (1997) 31-88
32. Baeza-Yates R.A., and Gonnet G.H. A New Approach to Text Searching (1989), ACM Press, Cambridge, MA, USA pp. 168-175
33. Angluin D. Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21 1 (1980) 46-62
34. B.S. Baker, Parameterized pattern matching by Boyer-Moore type algorithms, in: Proc. of ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 541-550.
35. Jiang T., Salomaa A., Salomaa K., and Yu S. Decision problems for patterns. J. Comput. Syst. Sci. 50 (1995) 53-63
36. V.T. Chakaravarthy, R. Krishnamurthy, The problem of context sensitive string matching, in: Combinatorial Pattern Matching (CPM), 2002, pp. 64-75.
37. du Mouza C., and Rigaux P. Mobility patterns. GeoInformatica 9 4 (2005) 297-319
38. Forgy C. Rete: a fast algorithm for the many patterns/many objects match problem. Artif. Intell. 19 1 (1982) 17-37
39. Cai J., Paige R., and Tarjan R.E. More efficient bottom-up multi-pattern matching in trees. Theor. Comput. Sci. 106 1 (1992) 21-60
40. Crochemore M., Czumaj A., Gasieniec L., Lecroq T., Plandowski W., and Rytter W. Fast practical multi-pattern matching. Inform. Process. Lett. 71 3-4 (1999) 107-113
41. C.Y. Chan, W. Fan, P. Felber, M.N. Garofalakis, R. Rastogi, Tree pattern aggregation for scalable XML data dissemination, in: Proc. Intl. Conf. on Very Large Data Bases (VLDB), 2002, pp. 826-837.
42. D. Shasha, J.T.-L. Wang, H. Shan, K. Zhang, ATreeGrep: approximate searching in unordered trees, in: Proc. Intl. Conf. on Scientific and Statistical Databases (SSDBM), 2002, pp. 89-98.