Abstract
Database integration of data mining has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind specialized implementation since the prohibitive nature of the cost associated with extracting knowledge, as well as the lack of suitable declarative query language support. Recent studies have found that for association rule mining and sequential pattern mining with carefully tuned SQL formulations it is possible to achieve performance comparable to systems that cache the data in files outside the DBMS. However most of the previous pattern mining methods follow the method of Apriori which still encounters problems when a sequential database is large and/or when sequential patterns to be mined are numerous and long.
In this paper, we present a novel SQL based approach that we recently proposed, called Prospad (PROjection Sequential PAttern Discovery). Prospad fundamentally differs from an Apriori-like candidate set generation-and-test approach. This approach is a pattern growth-based approach without candidate generation. It grows longer patterns from shorter ones by successively projecting the sequential table into subsequential tables. Since a projected table for a sequential pattern i contains all and only necessary information for mining the sequential patterns that can grow from i, the size of the projected table usually reduces quickly as mining proceeds to longer patterns. Moreover, avoiding creating and dropping cost of some temporary tables, depth first approach is used to facilitate the projecting process.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Srikant, R.: Mining sequential patterns. In: Eleventh International Conference on Data Engineering, Taipei, Taiwan, pp. 3–14. IEEE Computer Society Press, Los Alamitos (1995)
Antunes, C., Oliveira, A.L.: Sequential pattern mining algorithms: Trade-offs between speed and memory. In: Second International Workshop on Mining Graphs, Trees and Sequences, Pisa, Italy (September 2004)
Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: KDD 2002: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 429–435. ACM Press, New York (2002)
Chaudhuri, S.: Data mining and database systems: Where is the intersection? In: Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, vol. 21(1) (March 1998)
Han, J., Fu, Y., Wang, W.: Dmql: A data mining query language for relational database. In: Proc. of the 1996 SIGMOD workshop on research issues on data mining and knowledge discovery, Montreal, Canada (1996)
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Prefixspan: Mining sequential patterns efficiently by prefixprojected pattern growth. In: Proc. 2001 Int. Conf. Data Engineering (ICDE 2001), Heidelberg, Germany, April 2001, pp. 215–224 (2001)
Sarawagi, S., Thomas, S., Agrawal, R.: Integrating association rule mining with relational database systems: Alternatives and implications. In: Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD 1998), Seattle, WA, June, pp. 345–354. ACM Press, New York (1998)
Shang, X., Sattler, K.: Depth-first frequent itemset mining in relational databases. In: Proc. ACM Symposium on Applied Computing SAC 2005, New Mexico, USA (2005)
Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3–17. Springer, Heidelberg (1996)
Thomas, S., Sarawagi, S.: Mining generalized association rules and sequential patterns using SQL queries. In: Knowledge Discovery and Data Mining, pp. 344–348 (1998)
Wojciechowski, M.: Mining various patterns in sequential data in an sql-like manner. In: ADBIS (Short Papers), pp. 131–138 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shang, X., Sattler, KU. (2005). Processing Sequential Patterns in Relational Databases. In: Tjoa, A.M., Trujillo, J. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2005. Lecture Notes in Computer Science, vol 3589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546849_43
Download citation
DOI: https://doi.org/10.1007/11546849_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28558-8
Online ISBN: 978-3-540-31732-6
eBook Packages: Computer ScienceComputer Science (R0)