Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons
SCG '87 Proceedings of the third annual symposium on Computational geometry
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
C4.5: programs for machine learning
C4.5: programs for machine learning
Finding nonrecursive envelopes for Datalog predicate
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Predicate migration: optimizing queries with expensive predicates
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Integrating association rule mining with relational database systems: alternatives and implications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Using neural networks for data mining
Future Generation Computer Systems - Special double issue on data mining
Chromatic nearest neighbor searching: a query sensitive approach
Computational Geometry: Theory and Applications
Machine Learning
An Extension to SQL for Mining Association Rules
Data Mining and Knowledge Discovery
A Tutorial on Support Vector Machines for Pattern Recognition
Data Mining and Knowledge Discovery
Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
An Interval Classifier for Database Mining Applications
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Optimization of Queries with User-defined Predicates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
NeuroRule: A Connectionist Approach to Data Mining
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Data Mining using MLC++, A Machine Learning Library in C++
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Factorizing complex predicates in queries to exploit indexes
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient Evaluation of Queries with Mining Predicates
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Incrementally maintaining classification using an RDBMS
Proceedings of the VLDB Endowment
International Journal of Information Management: The Journal for Information Professionals
| Hi-index | 0.00 |
Modern relational database systems are beginning to support ad hoc queries on mining models. In this article, we explore novel techniques for optimizing queries that contain predicates on the results of application of 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 a large class of popular discrete mining models: decision trees, naive Bayes, clustering and linear support vector machines. Our experiments on Microsoft SQL Server demonstrate that these derived predicates can significantly reduce the cost of evaluating such queries.