Fast incremental maintenance of approximate histograms

  • Authors:

  • Phillip B. Gibbons;Yossi Matias;Viswanath Poosala

  • Affiliations:

  • Intel Research Pittsburgh, Pittsburgh, PA;Tel Aviv University, Tel Aviv, Israel;Bell Laboratories, Murray Hill, NJ

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many commercial database systems maintain histograms to summarize the contents of large relations and permit efficient estimation of query result sizes for use in query optimizers. Delaying the propagation of database updates to the histogram often introduces errors into the estimation. This article presents new sampling-based approaches for incremental maintenance of approximate histograms. By scheduling updates to the histogram based on the updates to the database, our techniques are the first to maintain histograms effectively up to date at all times and avoid computing overheads when unnecessary. Our techniques provide highly accurate approximate histograms belonging to the equidepth and Compressed classes. Experimental results show that our new approaches provide orders of magnitude more accurate estimation than previous approaches.An important aspect employed by these new approaches is a backing sample, an up-to-date random sample of the tuples currently in a relation. We provide efficient solutions for maintaining a uniformly random sample of a relation in the presence of updates to the relation. The backing sample techniques can be used for any other application that relies on random samples of data.