Department of Computing, Curtin University, Bentley 6102, Western Australia, Australia.

---

Abstract—Approximate query processing based on random sampling is one of the most useful methods for the efficient computation of large quantities of data kept in databases. However, small samples obtained through random sampling methods might lack the appropriate data relevant to query conditions because the samples do not adequately represent the entire dataset. The Multidimensional Cluster Sampling View has been proposed to support efficient and effective approximate query processing on common database tables. This view provides random sample records to be drawn from a database in SQL efficiently and effectively. The effectiveness of approximate query processing in this view was demonstrated on a large database table with only four dimensions. This differed from the usual number of dimensions in decision support systems, which is most commonly over ten. Therefore, further examinations and evaluations focusing on dimensionality, such as ten-dimensional data and over, are required in order to demonstrate its practicality. This paper evaluates whether the number of dimensions have an impact on the accuracy of the approximation and on the performance of the Multidimensional Cluster Sampling View. The results of the evaluation show that the effects of dimensionality are not visible.

Index Terms—Approximate query processing, databases, data warehouses, decision support systems, dimensionality, indexing, sampling.

[PDF]

Cite: Tomohiro Inoue, Aneesh Krishna, Raj P. Gopalan, "Approximate Query Processing on High Dimensionality Database Tables Using Multidimensional Cluster Sampling View," Journal of Software vol. 11, no. 1, pp. 80-93, 2016.