We have solved the following problem using Pattern Classijication Techniques (PCT): Given two histogram methods M I and M2 used in query optimization, ifthe esti-mation accuracy of M1 is greater than that of M2, then M I has a higher probabilio of leading to the optimal Query Evaluation Plan (QEP) than M2. To the best of our knowl-edge. this problem has been open for at least two decades, the difJicul9 of the problem partially being due to the hur-dles involved in the formulation itseg By formulating the problem from a Pattern Recognition (PR) perspective, we use PCT to present a mathematical, rigorous proof of this fact, and show some uniqueness results. We also report em-pirical results demonstrating the power of these theoretical results...
Accurate cost and time estimation of a query is one of the major success indicators for database man...
AbstractRecently, histograms have been considered as an effective way to produce quick approximate a...
An assumption with self-tuning histograms has been that they can "learn" the dataset if given enough...
We have solved the following problem using pattern classification techniques (PCT): given two histog...
The problem of database query optimization consisting of the system choosing the most economical que...
One of the most difficult tasks in modern day database management systems is information retrieval. ...
Many optimization problems in computer science have been proven to be NP-hard, and it is unlikely th...
Obtaining the optimal query execution plan requires a selectivity estimation. The selectivity value ...
Summarization: Many current relational database systems use some form of histograms to approximate t...
Histograms have long been used to capture attribute value distribution statistics for query optimize...
This paper aims to improve the accuracy of query result-size estimations in query optimizers by leve...
Accurate selectivity estimations are essential for query optimization decisions where they are typic...
Answering queries approximately has recently been proposed as a way to reduce query response times i...
Random sampling is a standard technique for constructing (approximate) histograms for query optimiza...
Part 4: Data Analysis and Information RetrievalInternational audienceSelectivity estimation is a par...
Accurate cost and time estimation of a query is one of the major success indicators for database man...
AbstractRecently, histograms have been considered as an effective way to produce quick approximate a...
An assumption with self-tuning histograms has been that they can "learn" the dataset if given enough...
We have solved the following problem using pattern classification techniques (PCT): given two histog...
The problem of database query optimization consisting of the system choosing the most economical que...
One of the most difficult tasks in modern day database management systems is information retrieval. ...
Many optimization problems in computer science have been proven to be NP-hard, and it is unlikely th...
Obtaining the optimal query execution plan requires a selectivity estimation. The selectivity value ...
Summarization: Many current relational database systems use some form of histograms to approximate t...
Histograms have long been used to capture attribute value distribution statistics for query optimize...
This paper aims to improve the accuracy of query result-size estimations in query optimizers by leve...
Accurate selectivity estimations are essential for query optimization decisions where they are typic...
Answering queries approximately has recently been proposed as a way to reduce query response times i...
Random sampling is a standard technique for constructing (approximate) histograms for query optimiza...
Part 4: Data Analysis and Information RetrievalInternational audienceSelectivity estimation is a par...
Accurate cost and time estimation of a query is one of the major success indicators for database man...
AbstractRecently, histograms have been considered as an effective way to produce quick approximate a...
An assumption with self-tuning histograms has been that they can "learn" the dataset if given enough...