Computing unrestricted synopses under maximum error bound

DOI10.1007/s00453-011-9571-9zbMath1259.68049OpenAlexW2065853778WikidataQ63457767 ScholiaQ63457767MaRDI QIDQ1939676

Yanyan Li

Publication date: 5 March 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9571-9

zbMATH Keywords

data compressionapproximation algorithmHaar waveletsapproximate query processingdata synopses

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Approximation algorithms (68W25)

Related Items (2)

Computing unrestricted synopses under maximum error bound ⋮ Finding the minimum number of elements with sum above a threshold

Cites Work

• Approximate query processing using wavelets
• Computing unrestricted synopses under maximum error bound
• Approximation Algorithms for Wavelet Transform Coding of Data Streams
• Database Theory - ICDT 2005
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Computing unrestricted synopses under maximum error bound