Efficient aggregation algorithms for probabilistic data

MaRDI QIDQ2934613zbMATH OpenFDO

Authors T. S. Jayram, Satyen Kale, Erik Vee

Publication date 18 December 2014

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• Aggregate operators in probabilistic databases
• scientific article; zbMATH DE number 2089480
• Probabilistic counting algorithms for data base applications
• Sliding-window probabilistic threshold aggregate queries on uncertain data streams
• CR-precis: A Deterministic Summary Structure for Update Data Streams

Cited in

(9)

• On the OWA Aggregation with Probabilistic Inputs
• Aggregate operators in probabilistic databases
• Continuous ranking on uncertain streams
• Range-max queries on uncertain data
• Efficient Sequential Aggregate Signed Data
• Sliding-window probabilistic threshold aggregate queries on uncertain data streams
• Computing rarity on uncertain data
• scientific article; zbMATH DE number 2089480 (Why is no real title available?)
• Space-efficient query evaluation over probabilistic event streams

This page was built for publication: Efficient aggregation algorithms for probabilistic data

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