Skip to main content
SpringerLink
Log in

Enhancing histograms by tree-like bucket indices

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques have been proposed in the past for determining bucket boundaries which provide accurate estimations. However, while search strategies for optimal bucket boundaries are rather sophisticated, no much attention has been paid for estimating queries inside buckets and all of the above techniques adopt naive methods for such an estimation. This paper focuses on the problem of improving the estimation inside a bucket once its boundaries have been fixed. The proposed technique is based on the addition, to each bucket, of a memory-word additional information (organized into a tree-like index), storing approximate cumulative frequencies in a hierarchical fashion. Both theoretical analysis and experimental results show that the proposed approach improves the accuracy of the estimation inside buckets, w.r.t. both classical approaches (like continuous value assumption and uniform spread assumption) and a number of alternative ways to organize the additional information. The index is later added to state-of-the-art histograms obtaining the non-obvious result that despite the spatial overhead which reduces the number of allowed buckets once the storage space has been fixed, the original methods are strongly improved in terms of accuracy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream system. In: PODS, pp 1–16 (2002)

  2. Buccafurri, F., Furfaro, F., Saccà, D.: Estimating range queries using aggregate data with integrity constraints: a probabilistic approach. In: Proc. of the 8th International Conference on Database Theory, pp. 390–404 (2001)

  3. Buccafurri, F., Pontieri, L., Rosaci, D., Saccà, D.: Improving range query estimation on histograms. In: Proceedings of the International Conference on Data Engineering, ICDE, pp. 628–638 (2002)

  4. Buccafurri, F., Rosaci, D., Saccà, D.: Compressed datacubes for fast olap applications. In: Proceedings of the Int. Conference on Data Warehousing and Knowledge Discovery, DaWaK, pp. 65–77 (1999)

  5. Chakrabarti K., Garofalakis M., Rastogi R. and Shim K. (2001). Approximate query processing using wavelets.. The VLDB J Int J Very Large Data Bases 10(2–3): 199–223

    MATH  Google Scholar 

  6. Christodoulakis, S.: Estimating selectivities in databases. PhD Thesis, CSRG Report N. 136, Department of Computer Science, University of Toronto (1981)

  7. Christodoulakis S. (1984). Implications of certain assumptions in database performance evauation. ACM Trans. Database Syst 9(2): 163–186

    Article  MATH  MathSciNet  Google Scholar 

  8. Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows: (extended abstract). In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 635–644. Society for Industrial and Applied Mathematics (2002)

  9. Deligiannakis, A., Roussopoulos, N.: Extended wavelets for multiple measures. In: SIGMOD ’03: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 229–240, New York. ACM Press (2003)

  10. Donjerkovic, D., Ioannidis, Y.E., Ramakrishnan, R.: Dynamic histograms: Capturing evolving data sets. In: ICDE, pp. 86 (2000)

  11. Garofalakis M. and Gibbons P.B. (2004). Probabilistic wavelet synopses. ACM Trans. Database Syst. 29(1): 43–90

    Article  Google Scholar 

  12. Guha, S., Koudas, N.: Approximating a data streams for querying and estimation: Algorithms and performance evaluation. In: ICDE, pp. 567–576 (2002)

  13. Guha, S., Koudas, N., Shim, K.: Data-streams and histograms. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 471–475. ACM Press (2001)

  14. Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Histogramming data streams with fast per-item processing. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, pp. 681–692. Springer (2002)

  15. Guha, S., Shim, K., Woo, J.: Rehist: relative error histogram construction algorithms. In: VLDB, pp. 300–311 (2004)

  16. Ioannidis, Y.: The history of histograms (abridged). In: Proceedings of 29th International Conference on Very Large Data Bases. Morgan Kaufmann, (2003)

  17. Ioannidis, Y.E., Poosala, V.: Balancing histogram optimality and practicality for query result size estimation. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pp. 233–244 (1995)

  18. Jagadish, H.V., Jin, H., Ooi, B.C., Tan, K.L.: Global optimization of histograms. In: Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, pp. 223–234. ACM Press (2001)

  19. Jagadish, H.V., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K.C., Suel, T.: Optimal histograms with quality guarantees In: Proc. 24th Int. Conf. Very Large Data Bases, VLDB, pp. 275–286, 24–27 (1998)

  20. Karras, P., Mamoulis, N.: One-pass wavelet synopses for maximum-error metrics. In: VLDB ’05: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 421–432. VLDB Endowment (2005)

  21. Knig, A.C., Weikum, G.: Auto-tuned spline synopses for database statistics managment. In: Proceedings of the 10th Conference on Managment of Data, Pune, India (2000)

  22. Koudas, N., Muthukrishnan, S., Srivastava, D.: Optimal histograms for hierarchical range queries (extended abstract). In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 196–204. ACM Press (2000)

  23. Malvestuto F.M. (1993). A universal-scheme approach to statistical databases containing homogeneous summary tables. ACM Trans. Database Systems (TODS) 18(4): 678–708

    Article  Google Scholar 

  24. Matias, Y., Vitter, J.S., Wang, M.: Wavelet-based histograms for selectivity estimation. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 448–459. ACM Press (1998)

  25. Muthukrishnan, S., Strauss, M.: Rangesum histograms. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete algorithms, pp. 233–242. Society for Industrial and Applied Mathematics (2003)

  26. Piatetsky-Shapiro, G., Connell, C.: Accurate estimation of the number of tuples satisfying a condition. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pp. 256–276. ACM Press (1984)

  27. Poosala, V.: Histogram-based estimation techniques in database systems. PhD dissertation, University of Wisconsin-Madison (1997)

  28. Poosala V., Ganti V. and Ioannidis Y.E. (1999). Approximate query answering using histograms. IEEE Data Eng. Bull. 22: 5–14

    Google Scholar 

  29. Poosala, V., Haas, P.J., Ioannidis, Y.E., Shekita, E.J.: Improved for selectivity estimation of range predicates. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 294–305. ACM Press (1996)

  30. Griffiths Selinger, P., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access path selection in a relational database management system. In: Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, pp. 23–34. ACM Press (1979)

  31. Sitzmann, I., Stuckey, P.J.: Improving temporal joins using histograms. In: Database and Expert Systems Applications, pp. 488–498 (2000)

  32. 1997 U.S. Census Statistics. http://www.census.gov/govs/www/ gid.html

  33. Thaper, N., Guha, S., Indyk, P., Koudas, N.: Dynamic multidimensional histograms. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pp. 428–439. ACM Press (2002)

  34. Wu Y.Q., Patel J.M. and Jagadish H.V. (2003). Using histograms to estimate answer sizes for xml queries. Inf. Syst. 28: 33–59

    Article  MATH  Google Scholar 

  35. Zipf G.K. (1949). Human Behaviour and the Principle of Least Effort. Addison-Wesley, Reading

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIMET Department, University “Mediterranea” of Reggio Calabria, Reggio Calabria, Italy

    Francesco Buccafurri, Gianluca Lax & Domenico Rosaci

  2. DEIS Department, University of Calabria and ICAR-CNR, Rende, Italy

    Domenico Saccà & Luigi Pontieri

Authors
  1. Francesco Buccafurri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gianluca Lax
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Domenico Saccà
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Luigi Pontieri
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Domenico Rosaci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Francesco Buccafurri.

Additional information

An abridged version of this paper appeared in the Proceedings of the International Conference on Data Engineering (ICDE 2002), IEEE Computer Society 2002, ISBN 0-7695-1531-2 [3].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buccafurri, F., Lax, G., Saccà, D. et al. Enhancing histograms by tree-like bucket indices. The VLDB Journal 17, 1041–1061 (2008). https://doi.org/10.1007/s00778-007-0050-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-007-0050-5

Keywords

Search

Navigation