Data source selection for approximate query

DOI10.1007/S10878-021-00760-YMaRDI QIDQ2084622zbMATH OpenOpenAlexFDO

Authors Hongjie Guo, Jianzhong Li, Hong Gao

Publication date 18 October 2022

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-021-00760-y

zbMATH Keywords

big datadata qualityquery approximationsource selection

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Stochastic network models in operations research (90B15)

Recommendations

• LAQP: learning-based approximate query processing
• On pricing approximate queries
• Making big data small
• A Bayesian method for query approximation
• Synopses for massive data: samples, histograms, wavelets, sketches

Cites work

• An analysis of approximations for maximizing submodular set functions—I
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Monte-Carlo approximation algorithms for enumeration problems
• Selecting sources for query approximation with bounded resources
• The budgeted maximum coverage problem

Cited in

(1)

• Selecting sources for query approximation with bounded resources

This page was built for publication: Data source selection for approximate query

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