Compact Fenwick trees for dynamic ranking and selection

  title={Compact Fenwick trees for dynamic ranking and selection},
  author={Stefano Marchini and S. Vigna},
  journal={Software: Practice and Experience},
  pages={1184 - 1202}
The Fenwick tree is a classical implicit data structure that stores an array in such a way that modifying an element, accessing an element, computing a prefix sum and performing a predecessor search on prefix sums all take logarithmic time. We introduce a number of variants which improve the classical implementation of the tree: in particular, we can reduce its size when an upper bound on the array element is known, and we can perform much faster predecessor searches. Our aim is to use our… Expand
2 Citations
Practical trade‐offs for the prefix‐sum problem
  • 2
  • PDF
Rank/Select Queries over Mutable Bitmaps
  • Highly Influenced
  • PDF


Succinct Dynamic Data Structures
  • 107
  • PDF
Broadword Implementation of Rank/Select Queries
  • 120
  • PDF
Succinct data structures for Searchable Partial Sums with optimal worst-case performance
  • 26
Optimized succinct data structures for massive data
  • 69
  • PDF
Succinct Partial Sums and Fenwick Trees
  • 9
  • PDF
A new data structure for cumulative frequency tables
  • P. Fenwick
  • Computer Science, Mathematics
  • Softw. Pract. Exp.
  • 1994
  • 183
  • PDF
A Framework of Dynamic Data Structures for String Processing
  • N. Prezza
  • Computer Science, Mathematics
  • SEA
  • 2017
  • 14
  • PDF
Optimal Bounds for the Predecessor Problem and Related Problems
  • 171
  • PDF
Space-efficient static trees and graphs
  • G. Jacobson
  • Mathematics, Computer Science
  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
  • 675
  • PDF
Dynamic entropy-compressed sequences and full-text indexes
  • 151
  • PDF