Abstract
Data mining is rapidly finding its way into mainstream computing. The development of generic methods such as itemset counting has opened the area to academic inquiry and has resulted in a large harvest of research results. While the mined datasets are often in relational format, most mining systems do not use relational DBMS. Thus, they miss the opportunity to leverage the database technology developed in the last couple of decades.
In this paper, we propose a data mining architecture, based on the query flock framework, that is tightly-coupled with RDBMS. To achieve optimal performance we transform a complex data mining query into a sequence of simpler queries that can be executed efficiently at the DBMS. We present a class of levelwise algorithms that generate such transformations for a large class of data mining queries. We also present some experimental results that validate the viability of our approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, T. Imilienski, and A. Swami Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 207–216, May 1993.
R. Agrawal and K. Shim Developing tightly-coupled applications on ibm db2/cs relational database system: Methodology and experience. Research report, IBM Almaden Research Center.
R. Agrawal and R. Srikant Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 487–499, Santiago, Chile, September 1994.
A. Chandra and P. Merlin Optimal implementation of conjunctive queries in relational databases. In Proceedings of 9th Annual ACM Symposium on the Theory of Computing, pages 77–90.
S. Chaudhuri and K. Shim Including group-by in query optimization. In Proceedings of the 20st International Conference on Very Large Data Bases, pages 354–366, Santiago, Chile, September 1994.
S. Chaudhuri and K. Shim Optimizing queries with aggregate views. In Proceedings of the 5th International Conference on Extending Database Technology, pages 167–182, Avignon, France, March 1996.
H. Houtsma and A. Swami Set-oriented mining of association rules. In Proceedings of International Conference on Data Engineering, pages 25–33, Taipei, Taiwan, March 1995.
S. Nestorov and S. Tsur Efficient implementation of query flocks. Technical report, Research and Development Lab, Hitachi America, Ltd., Santa Clara, California, September 1998.
R. Ng, L. Lakshmanan, J. Han, and A. Pang Exploratory mining and pruning optimizations of constrained associations rules. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 13–24, Seattle, Washington, June 1998.
S. Sarawagi, S. Thomas, and R. Agrawal Integrating association rule mining with relational database systems: Alternatives and implications. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 343–354, Seattle, Washington, June 1998.
S. Tsur, J. Ullman, C. Clifton, S. Abiteboul, R. Motwani, S. Nestorov, and A. Rosenthal Query flocks: a generalization of association-rule mining. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 1–12, Seattle, Washington, June 1998.
J.D. Ullman Principles of Database and Knowledge-Base Systems, Volumes I,II. Computer Science Press, Rockville, Maryland, 1989.
W. Yan and P. Larson Eager aggregation and lazy aggregation. In Proceedings of the 21st International Conference on Very Large Data Bases, pages 345–357, Zurich, Switzerland, September 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nestorov, S., Tsur⋆, S. (1999). Integrating Data Mining with Relational DBMS: A Tightly-Coupled Approach. In: Pinter, R.Y., Tsur, S. (eds) Next Generation Information Technologies and Systems. NGITS 1999. Lecture Notes in Computer Science, vol 1649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48521-X_23
Download citation
DOI: https://doi.org/10.1007/3-540-48521-X_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66225-9
Online ISBN: 978-3-540-48521-6
eBook Packages: Springer Book Archive