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
• Probabilistic aggregates
• 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)

• Range-max queries on uncertain data
• Sliding-window probabilistic threshold aggregate queries on uncertain data streams
• Probabilistic aggregates
• Computing rarity on uncertain data
• Aggregate operators in probabilistic databases
• On the OWA Aggregation with Probabilistic Inputs
• Space-efficient query evaluation over probabilistic event streams
• Efficient Sequential Aggregate Signed Data
• Continuous ranking on uncertain 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)