Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Efficient Evaluation of Queries with Mining Predicates

Surajit Chaudhuri, Vivek Narasayya, and Sunita Sarawagi


Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining models to relational data. For such queries, we use the internal structure of the mining model to automatically derive traditional database predicates. We present algorithms for deriving such predicates for some popular discrete mining models: decision trees, naive Bayes, and clustering. Our experiments on Microsoft SQL Server 2000 demonstrate that these derived predicates can significantly reduce the cost of evaluating such queries.


Publication typeInproceedings
Published in18th International Conference on Data Engineering
PublisherIEEE Computer Society
> Publications > Efficient Evaluation of Queries with Mining Predicates