Space-efficient query evaluation over probabilistic event streams

DOI10.1145/3373718.3394747MaRDI QIDQ5145621zbMATH OpenOpenAlexFDO

Authors Yu Chen, Kishor Jothimurugan, Sanjeev Khanna, Rajeev Alur

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3373718.3394747

zbMATH Keywords

probabilistic streamsquery processing over streamsstreaming algorithms

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Recommendations

• Complex event processing over distributed probabilistic event streams
• Probabilistic querying over uncertain data streams
• Sliding-window probabilistic threshold aggregate queries on uncertain data streams
• Efficient aggregation algorithms for probabilistic data
• WD-PWS: the first semantics for querying over probabilistic data streams with continuous distributions

Cited in

(1)

• Complex event processing over distributed probabilistic event streams

This page was built for publication: Space-efficient query evaluation over probabilistic event streams

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