• DocumentCode
    2730293
  • Title

    The Haar+ Tree: A Refined Synopsis Data Structure

  • Author

    Karras, Panagiotis ; Mamoulis, Nikos

  • Author_Institution
    Dept. of Comput. Sci., Hong Kong Univ., China
  • fYear
    2007
  • fDate
    15-20 April 2007
  • Firstpage
    436
  • Lastpage
    445
  • Abstract
    We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis quality at the task of summarizing data sets with sharp discontinuities than state-of-the-art histogram and Haar wavelet techniques. Second, thanks to its search space delimitation capacity, Haar+ synopsis construction operates in time linear to the size of the data set for any monotonic distributive error metric. Through experimentation, we demonstrate the superiority of Haar+ synopses over histogram and Haar wavelet methods in both construction time and achieved quality for representative error metrics.
  • Keywords
    Haar transforms; tree data structures; tree searching; wavelet transforms; Haar wavelet technique; Haar+ synopsis construction; Haar+ tree; refined synopsis data structure; search space delimitation capacity; Tree data structures;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on
  • Conference_Location
    Istanbul
  • Print_ISBN
    1-4244-0802-4
  • Type

    conf

  • DOI
    10.1109/ICDE.2007.367889
  • Filename
    4221692