Approximate query processing over static sets and sliding windows

DOI10.1016/j.tcs.2021.06.015OpenAlexW3173261093MaRDI QIDQ1981762

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

Publication date: 6 September 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.05419

zbMATH Keywords

algorithmslower boundssliding windowstreaming

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Optimal indexes for sparse bit vectors
• Succinct data structures for searchable partial sums with optimal worst-case performance
• Space Efficient Suffix Trees
• Time-space trade-offs for predecessor search
• Rank/select operations on large alphabets
• Maintaining Stream Statistics over Sliding Windows
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Succinct Color Searching in One Dimension
• Estimating the number of Active Flows in a Data Stream over a Sliding Window
• Practical Entropy-Compressed Rank/Select Dictionary
• Efficient Summing over Sliding Windows
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item