SQL Database Primitives for Decision Tree Classifiers

Scalable data mining in large databases is one of today's challenges to database technologies. Thus, substantial effort is dedicated to a tight coupling of database and data mining systems leading to database primitives supporting data mining tasks. In order to support a wide range of tasks and to be of general usage these primitives should be rather building blocks than implementations of specific algorithms. In this paper, we describe primitives for building and applying decision tree classifiers. Based on the analysis of available algorithms and previous work in this area we have identified operations which are useful for a number of classification algorithms. We discuss the implementation of these primitives on top of a commercial DBMS and present experimental results demonstrating the performance benefit.

• Type: Conference
• Year: 2001
• Where: CIKM
• Authors: Kai-Uwe Sattler, Oliver Dunemann
• Keywords: CIKM 2001, Data Mining, Database, Information Management, Primitives Supporting Data