On-line aggregation and filtering of pattern-based queries

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn , Issue , 2006, Pages 333-342

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

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b Bioinformatique et Chimie Moléculaire   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; DATABASE SYSTEMS; FILTRATION; MANAGEMENT INFORMATION SYSTEMS; STATISTICAL METHODS; STATISTICS;

CONTINUOUS QUERIES; DATABASE MANAGEMENT; IN ORDER; INTERNATIONAL CONFERENCES; LATTICE STRUCTURES; LINE PATTERNING; MATCHING PROCESSING; PARAMETERIZED; PATTERN-MATCHING; SEQUENTIAL DATA;

COST BENEFIT ANALYSIS;

EID: 45149084298     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDBM.2006.37     Document Type: Conference Paper

References (23)

1. D. Angluin. Finding Patterns Common to a Set of Strings. Journal of Computer and System Sciences, 21(1):46-62, 1980.
2. M. J. Atallah and S. Fox, editors. Algorithms and Theory of Computation Handbook. CRC Press, Inc., 1998.
3. A.V.Aho, M.R.Garey, and J.D.Ullman. The Transitive Reduction of a Directed Graph. SIAM Society for Industrial and Applied Mathematics, 1:131-137, 1972.
4. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and Issues in Data Stream Systems. In Proc. ACM Symp. on Principles of Database Systems (PODS), pages 1-16, 2002.
5. J. Cai, R. Paige, and R. E. Tarjan. More Efficient Bottom-Up Multi-Pattern Matching in Trees. Theoretical Computer Science, 106(1):21-60, 1992.
6. C. Y. Chan, W. Fan, P. Felber, M. N. Garofalakis, and R. Rastogi. Tree Pattern Aggregation for Scalable XML Data Dissemination. In Proc. Intl. Conf. on Very Large Data Bases (VLDB), pages 826-837, 2002.
7. M. Crochemore, A. Czumaj, L. Gasieniec, T. Lecroq, W. Plandowski, and W. Rytter. Fast Practical Multi-Pattern Matching. Information Processing Letters, 71(3-4): 107-113, 1999.
8. A. Demers, J. Gehrke, M. Hong, M. Riedewald, and W. White. Towards Expressive Publish/Subscribe Systems. In Proc. Intl. Conf. on Extending Data Base Technology (EDBT), 2006.
9. C. du Mouza and P. Rigaux. Mobility Patterns. GeoInformatica, 9(4), 2005.
10. C. du Mouza, P. Rigaux, and M. Scholl. Efficient evaluation of parameterized pattern queries. In Proc. Intl. Conf. on Information and Knowledge Management (CIKM), pages 728-735, 2005.
11. F. Fabret, H.-A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha. Filtering Algorithms and Implementation for Very Fast Publish/Subscribe. In Proc. ACM Symp. on the Management of Data (SIGMOD), 2001.
12. C. Forgy. Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem. Artif. Intell., 19(1):17-37, 1982.
13. V. Guralnik and J. Srivastava. Event detection from time series data. In Proc. Intl. Conf. on Knowledge Discovery and Data Mining (KDD), pages 33-42, 1999.
14. D. Knuth, J. Morris, and V. Pratt. Fast Pattern Matching in Strings. SIAM J. Computing, 6(2):323-350, 1977.
15. J. Kuri and G. Navarro. Fast Multipattern Search Algorithms for Intrusion Detection. In String Processing and Information Retrieval (SPIRE), pages 169-180, 2000.
16. G. M. Landau and U. Vishkin. Fast String Matching with k Differences. J. Comput. Syst. Sci., 37(1):63-78, 1988.
17. Y.-N. Law, H. Wang, and C. Zaniolo. Query Languages and Data Models for Database Sequences and Data Streams. In Proc. Intl. Conf. on Very Large Data Bases (VLDB), pages 492-503, 2004.
18. S. Madden, M. A. Shah, J. M. Hellerstein, and V. Raman. Continuously Adaptive Continuous Queries over Streams. In Proc. ACM Symp. on the Management of Data (SIGMOD), 2002.
19. N. Mamoulis, H. Cao, G. Kollios, M. Hadjieleftheriou, Y. Tao, and D. W. Cheung. Mining, indexing, and querying historical spatiotemporal data. In Proc. Intl. Conf. on Knowledge Discovery and Data Mining (KDD), pages 236-245, 2004.
20. C. Olston, J. Jiang, and J. Widom. Adaptive Filters for Continuous Queries over Distributed Data Streams. In Proc. ACM Symp. on the Management of Data (SIGMOD), pages 563-574, 2003.
21. D. Shasha, J. T-L. Wang, H. Shan, and K. Zhang. ATree-Grep: Approximate Searching in Unordered Trees. In Proc. Intl. Conf. on Scientific and Statistical Databases (SSDBM), pages 89-98, 2002.
22. E. Ukkonen. Finding Approximate Patterns in Strings. J. Algorithms, 6(1): 132-137, 1985.
23. S. Wu and U. Manber. Fast Text Searching Allowing Errors. Commun. ACM, 35(10):83-91, 1992.