Abstract
Data warehouses must be able to process and analyze large amounts of information quickly and efficiently. Small summaries provide a very efficient way to obtain fast approximate answers to complex queries that run for too long. This paper proposes an efficient hierarchical partitioning strategy vmhist achieving a large improvement in the accuracy of the summary while maintaining all scalability. This is achieved by pre-computation, localized updating and additivity of the error measures used in the partitioning process. Evaluation reveals that a significant accuracy improvement is obtained for summaries produced with vmhist without significant increase in histogram construction time cost.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H.V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. Sevcik, and T. Suel, “Optimal Histograms with Quality Guarantees”, in Proc. 24th International Conference on Very Large Data Bases, August 1998, pp. 275–286.
S. Muthukrishnan, V. Poosala and T. Suel. “On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity and Applications”, in Procs. of the International Conference on Database Theory, Jerusalem, 1999.
V. Poosala, Y. Ioannidis, “Selectivity Estimation Without the Attribute Value Independence Assumption”, Proceedings of the 23rd VLDB Conference, Athens, Greece, 1997.
V. Poosala, “Histogram-Based Estimation Techniques in Database Systems”. PhD Thesis, University of Winsconsin-Madison, 1997.
V. Poosala, V. Ganti, “Fast Approximate Answers to Aggregate Queries on a Data Cube”. 11th International Conference on Scientific and Statistical Database Management, Cleveland, Ohio, USA, 1999. IEEE Computer Society.
Special Issue on Data Reduction Techniques of the Bulletin of the Technical Committee on Data Engineering of the IEEE Computer Society, December 1997, Vol. 20, n 4.
T. Zhang, R. Ramakrishnan and M. Livny, “BIRCH: an Efficient Data Clustering Method for Very Large Databases”, Proc. 1996 SIGMOD.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Furtado, P., Madeira, H. (2000). Vmhist: Efficient Multidimensional Histograms with Improved Accuracy. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2000. Lecture Notes in Computer Science, vol 1874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44466-1_44
Download citation
DOI: https://doi.org/10.1007/3-540-44466-1_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67980-6
Online ISBN: 978-3-540-44466-4
eBook Packages: Springer Book Archive