Building data synopses within a known maximum error bound

  • Authors:
  • Chaoyi Pang;Qing Zhang;David Hansen;Anthony Maeder

  • Affiliations:
  • eHealth Research Centre, ICT CSIRO, Australia;eHealth Research Centre, ICT CSIRO, Australia;eHealth Research Centre, ICT CSIRO, Australia;eHealth Research Centre, ICT CSIRO, Australia

  • Venue:
  • APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a guaranteed maximum error has gained attention. Two relevant problems have been proposed: One is the size bounded problem that requires the construction of a synopsis of a given size to minimize the maximum error. Another is the error bounded problem that requires a minimum sized synopsis be built to satisfy a given error bound. The optimum algorithms for these two problems take O(N2) time complexity. In this paper, we provide new algorithms for building error-bounded synopses. We first provide several property-based pruning techniques, which can greatly improve the performance of optimal error bounded synopses construction. We then demonstrate the efficiencies and effectiveness of our techniques through extensive experiments.