Approximate query processing over static sets and sliding windows

DOI10.4230/LIPICS.ISAAC.2018.54MaRDI QIDQ5091046zbMATH OpenFDO

Authors Basat Ran Ben, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare

Publication date 21 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2018.54

zbMATH Keywords

algorithmslower boundsstreamingsliding window

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Approximate query processing over static sets and sliding windows
• Succinct summing over sliding windows
• Efficient Summing over Sliding Windows
• scientific article; zbMATH DE number 2119721
• Maintaining Stream Statistics over Sliding Windows

Cites work

• scientific article; zbMATH DE number 1830754 (Why is no real title available?)
• scientific article; zbMATH DE number 871936 (Why is no real title available?)
• Distributed streams algorithms for sliding windows
• Efficient Summing over Sliding Windows
• Give me some slack: efficient network measurements
• Maintaining Stream Statistics over Sliding Windows
• Optimal indexes for sparse bit vectors
• Practical entropy-compressed rank/select dictionary
• Rank/select operations on large alphabets
• Space efficient suffix trees
• Succinct color searching in one dimension
• Succinct data structures for searchable partial sums with optimal worst-case performance
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets

Cited in

(1)

• Approximate query processing over static sets and sliding windows

This page was built for publication: Approximate query processing over static sets and sliding windows

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