Time- and space-efficient sliding window top-k query processing

DOI10.1145/2736701MaRDI QIDQ5012517zbMATH OpenOpenAlexFDO

Authors Krešimir Pripužić, Ivana Podnar Žarko, Karl Aberer

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://infoscience.epfl.ch/record/208386/files/a1-pripuzic.pdf

zbMATH Keywords

continuous top-k queriesdata stream processingsliding windows

Mathematics Subject Classification ID

Database theory (68P15) Online algorithms; streaming algorithms (68W27)

Recommendations

• A top-K queries algorithm for uncertain data streams based on sliding-window
• Effective space usage estimation for sliding-window skybands
• Top-\(k\) frequent items and item frequency tracking over sliding windows of any size
• Effective and efficient top-\(k\) query processing over incomplete data streams
• Optimal sampling from sliding windows

Cited in

(7)

• Succinct summing over sliding windows
• A time optimized scheme for top-\( k\) list maintenance over incomplete data streams
• Supporting early pruning in top-\(k\) query processing on massive data
• Effective space usage estimation for sliding-window skybands
• Effective and efficient top-\(k\) query processing over incomplete data streams
• Sliding-window probabilistic threshold aggregate queries on uncertain data streams
• A top-K queries algorithm for uncertain data streams based on sliding-window

This page was built for publication: Time- and space-efficient sliding window top-k query processing

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