Succinct partial sums and Fenwick trees

DOI10.1007/978-3-319-67428-5_8MaRDI QIDQ5150921zbMATH OpenOpenAlexFDO

Authors Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen

Publication date 16 February 2021

Published in String Processing and Information Retrieval (Search for Journal in Brave)

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

zbMATH Keywords

partial sumsparallelizationsuccinct data structuresFenwick treesuccinct space

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)

Abstract: We consider the well-studied partial sums problem in succint space where one is to maintain an array of n k-bit integers subject to updates such that partial sums queries can be efficiently answered. We present two succint versions of the Fenwick Tree - which is known for its simplicity and practicality. Our results hold in the encoding model where one is allowed to reuse the space from the input data. Our main result is the first that only requires nk + o(n) bits of space while still supporting sum/update in O(log_b n) / O(b log_b n) time where 2 <= b <= log^O(1) n. The second result shows how optimal time for sum/update can be achieved while only slightly increasing the space usage to nk + o(nk) bits. Beyond Fenwick Trees, the results are primarily based on bit-packing and sampling - making them very practical - and they also allow for simple optimal parallelization.

Recommendations

• scientific article; zbMATH DE number 1830754
• Fully-functional succinct trees
• Succinct data structures for searchable partial sums with optimal worst-case performance
• Algorithms and Computation
• Cell-probe lower bounds for succinct partial sums

Cites work

• scientific article; zbMATH DE number 140457 (Why is no real title available?)
• scientific article; zbMATH DE number 1830754 (Why is no real title available?)
• Logarithmic Lower Bounds in the Cell-Probe Model
• On the Complexity of Maintaining Partial Sums
• Succinct data structures for searchable partial sums with optimal worst-case performance
• The Complexity of Maintaining an Array and Computing Its Partial Sums

Cited in

(6)

• Random access in persistent strings and segment selection
• Faster online computation of the succinct longest previous factor array
• Succinct data structures for searchable partial sums with optimal worst-case performance
• Partial sums on the ultra-wide word RAM
• Algorithms and Computation
• scientific article; zbMATH DE number 7765406 (Why is no real title available?)

This page was built for publication: Succinct partial sums and Fenwick trees

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