The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering (ICDE) (2002)
San Jose, California
Feb. 26, 2002 to Mar. 1, 2002
ISBN: 0-7695-1531-2
pp: 0529
Sunita Sarawagi , IIT Bombay
Surajit Chaudhuri , Microsoft Corp.
Vivek Narasayya , Microsoft Corp.
ABSTRACT
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 signi?cantly reduce the cost of evaluating such queries.
INDEX TERMS
CITATION
Sunita Sarawagi, Surajit Chaudhuri, Vivek Narasayya, "Efficient Evaluation of Queries with Mining Predicates", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 0529, 2002, doi:10.1109/ICDE.2002.994772
97 ms
(Ver 3.3 (11022016))