Query size estimation using clustering techniques

For managing the performance of database management systems, we need to be able to estimate the size of queries. Query size estimation (QSE) is difficult if the queries are associated with more than one attribute. Here, we propose, and experimentally evaluate, a novel technique that builds on cluster analysis. Empirical results indicate that, in particular, density-based clustering QSE techniques are beneficial for medium and large sized databases where they compare favourably with partitioning clustering QSE ones such as k-means. This is observed especially in the case of noisy and dense datasets