Constructing Chebyshev polynomial synopses with greedy strategy

DOI10.3724/SP.J.1087.2009.02253MaRDI QIDQ3399014zbMATH OpenOpenAlexFDO

Authors Fangyuan Li, Haijiang He

Publication date 29 September 2009

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1087.2009.02253

zbMATH Keywords

frequency distributiondatabase relation attribute

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Inner-Product Based Wavelet Synopses for Range-Sum Queries
• Computing unrestricted synopses under maximum error bound
• Synopses for massive data: samples, histograms, wavelets, sketches
• Chebyshev polynomials, moment matching, and optimal estimation of the unseen
• Optimal workload-based weighted wavelet synopses

This page was built for publication: Constructing Chebyshev polynomial synopses with greedy strategy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399014)