ACM Home Page
Please provide us with feedback. Feedback
Expressing and optimizing sequence queries in database systems
Full text PdfPdf (427 KB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 29 ,  Issue 2  (June 2004) table of contents
Pages: 282 - 318  
Year of Publication: 2004
ISSN:0362-5915
Authors
Reza Sadri  Procom Technology Inc., Irvine, California, CA
Carlo Zaniolo  UCLA Computer Science Department, Los Angeles, California, CA
Amir Zarkesh  3Plus1 Technology, Inc., Saratoga, California, Saratoga, CA
Jafar Adibi  Information Sciences Institute, USC, Marina del Rey, California, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 178,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1005566.1005568
What is a DOI?

ABSTRACT

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 complex sequential patterns in database systems. Thus, we first introduce SQL-TS, an extension of SQL to express these patterns, and then we study how to optimize the 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 interdependencies between the elements of a 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Alur, N., Haas, P., Momiroska, D., Read, P., Summers, N., Totanes, V., and Zuzarte, C. 2002. Db2 UDBS high-function business intelligence in e-business. IBM redbooks, IBM, http://www.redbooks.ibm.com/redbooks/pdfs/sg246546.pdf.
 
3
Arasu, A., Babu, S., and Widom, J. 2002. An abstract semantics and concrete language for continuous queries over streams and relations. Tech. rep., Stanford Univ., Stanford, Calif.
4
 
5
 
6
Boag, S., Chamberlin, D., Fernandez, M. F., Florescu, D., Robie, J., and Simeon, J. (Eds.). 2003. Xquery 1.0: An XML query language--working draft 22 august 2003. Working Draft 22 August 2003, W3C, http://www.w3.org/tr/xquery/.
7
 
8
Carney, D., Cetintemel, U., Cherniack, M., Convey, C., Lee, S., Seidman, G., Stonebraker, M., Tatbul, N., and Zdonik, S. 2002. Monitoring streams---A new class of data management applications. In VLDB (Hong Kong, China).
9
 
10
Edwards, R. and Magee, J. 1997. Technical Analysis of Stock Trends. AMACOM.
11
12
 
13
Gatziu, S. and Dittrich, K. R. 1993. Events in an object-oriented database system. In Proceedings of the 1st International Conference on Rules in Database Systems.
 
14
 
15
16
17
 
18
Informix Software, Inc. 1998. Managing time-series data in financial applications. White Paper.
 
19
20
 
21
Knuth, D. E., Morris, J. H., and Pratt, V. R. 1997. Fast pattern matching in strings. SIAM J. Comput. 6, 2 (June), 323--350.
 
22
Mesrobian, E., Muntz, R., Santos, J., Shek, E., Mechoso, C., Farrara, J., and Stolorz, P. 1994. Extracting spatio-temporal patterns from geoscience datasets. In Proceedings of the IEEE Workshop on Visualization and Machine Vision.
23
 
24
 
25
 
26
 
27
Rosenkrantz, D. and Hunt III, H. B. 1970. Processing conjunctive predicates and queries. In Proceedings of the 6th International Conference on Very Large Databases. 64--72.
 
28
29
30
 
31
 
32
 
33
 
34
 
35
 
36
 
37
Wright, C. A., Cumberland, L., and Feng, Y. 1998. A performance comparison between five string pattern matching algorithms. Technical Report. http://ocean.st.usm.edu/∼cawright/pattern_matching.html.
 
38
Zemke, F., Kulkarni, K., Witkowski, A., and Lyle, B. 1999. Proposal for OLAP functions. Tech. Rep. ANSI NCITS H2-99-155, ISO/IEC JTC1/SC32 WG3:YGJ-nnn, http://ganga.iiml.ac.in/∼bhasker/dmds/99-154.pdf.

CITED BY  8


REVIEW

"Alan Raymond Hevner : Reviewer"

Sequence queries scan databases to detect patterns and trends of interest. For example, analyses of stock market prices, meteorological trends, and consumer purchasing patterns can be supported via appropriately defined sequence queries on typical  more...

Collaborative Colleagues:
Reza Sadri: colleagues
Carlo Zaniolo: colleagues
Amir Zarkesh: colleagues
Jafar Adibi: colleagues