Reza Sadri
ABSTRACT
The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we discuss how to express and support efficiently sophisticated sequential pattern queries in databases. Thus, we first introduce SQL-TS, an extension of SQL, to express these patterns, and then we study how to optimize search queries for this language. We take the optimal text search algorithm of Knuth, Morris and Pratt, and generalize it to handle complex queries on sequences. Our algorithm exploits the inter-dependencies between the elements of a sequential pattern to minimize repeated passes over the same data. Experimental results on typical sequence queries, such as double bottom queries, confirm that substantial speedups are achieved by our new optimization techniques.
- 1.R. Agrawal and R. Srikant. Mining sequential patterns. In International Conference on Data Engineerin, 1995. Google Scholar
Digital Library
- 2.M. Berry and G. Linoff, Data Mining Techniques: For Marketing, Sales, and Customer Support. John Wiley, 1997. Google ScholarDigital Library
- 3.R.D. Edwards and J. Magee. Technical Analysis of Stock Trends. AMACOM, 1997.Google Scholar
- 4.C. Faloutsos, M. Ranganathan, and Manolopoulos Y. Fast subsequence matching in time-series databases. In Proc. Int. Conf. On Management of Data, pages 419-429, 1994. Google ScholarDigital Library
- 5.S. Guo, W. Sun, and M. Weiss. On satisfiability, equivalence, and implication problems involving conjunctive queries in database systems. IEEE Transactions on Knowledge and Data Engineering, 8(4):604-616, August 1996. Google ScholarDigital Library
- 6.Informix Software Inc. Managing time-series data in financial applications, 1998. White Paper.Google Scholar
- 7.R. Karp and M. O. Rabin. Efficient Randomized Pattern Matching Algorithm. IBM Journal of Research and Developement, 31(2):249-260, March 1987. Google ScholarDigital Library
- 8.D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM Journal of Computing, 6(2):323-350, June 1977.Google ScholarDigital Library
- 9.E. Mesrobian et al., Extracting spatio-temporal patterns from geoscience datasets. In IEEE Workshop on Visualization and Machine Vision, 1994.Google ScholarCross Ref
- 10.J. S. Moore and R. S. Boyer. A Fast String Searching Algorithma. Communications of ACM, 20(10):762-772, 1977. Google ScholarDigital Library
- 11.I. Motakis and C. Zaniolo. Temporal aggregation in active databases. In Int. Conf. on the Management of Data, May 1997. Google ScholarDigital Library
- 12.R. Ramakrishnan et al., SRQL: sorted relational query language, SSDBM 1998: 84-95. Google ScholarDigital Library
- 13.R. Sadri, Optimization of Sequence Queries in Database Systems Ph.D. Thesis, UCLA, 2001. Google ScholarDigital Library
- 14.P. Seshadri. Predator: A resource for database research. SIGMOD Record, 27(1):16-20, 1998. Google ScholarDigital Library
- 15.P. Seshadri, M. Livny, and R. Ramakrishnan. Sequence query processing. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 430-441, May 1994. Google ScholarDigital Library
- 16.P. Seshadri, M. Livny, and R. Ramakrishnan. SEQ: A model for sequence databases. In ICDE, pages 232-239, 1995. Google ScholarDigital Library
- 17.H. Wang and C. Zaniolo. Using SQL to Build New Aggregates and Extenders for Object-Relational Systems. In Proceedings of 26th International Conference on Very Large Data Bases, 2000. Google ScholarDigital Library
- 18.C. A. Wright, L. Cumberland and Y. Feng, A Performance Comparison Between Five String Pattern Matching Algorithms, Dec. 98 Tech.Report, http://ocean.st.usm.edu/cawright/ pattern matching.htmlGoogle Scholar
Index Terms
- Optimization of sequence queries in database systems
Recommendations
Expressing and optimizing sequence queries in database systems
The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we investigate the design and optimization of a query language capable of expressing and supporting efficiently the search for ...
Comments