A new data structure for cumulative frequency tables

  title={A new data structure for cumulative frequency tables},
  author={P. Fenwick},
  journal={Software: Practice and Experience},
  • P. Fenwick
  • Published 1994
  • Computer Science, Mathematics
  • Software: Practice and Experience
A new method (the ‘binary indexed tree’) is presented for maintaining the cumulative frequencies which are needed to support dynamic arithmetic data compression. It is based on a decomposition of the cumulative frequencies into portions which parallel the binary representation of the index of the table element (or symbol). The operations to traverse the data structure are based on the binary coding of the index. In comparison with previous methods, the binary indexed tree is faster, using more… Expand
A Constant Optimization of the Binary Indexed Tree Query Operation
A Versatile and Efficient GPU Data Structure for Spatial Indexing
  • J. Schneider, P. Rautek
  • Computer Science, Medicine
  • IEEE Transactions on Visualization and Computer Graphics
  • 2017
Implementing a Novel Data Structure for Maintaining Cumulative Frequency of Symbols
A new approach to adaptive encoding data using self-organizing data structures
  • L. Rueda, B. John Oommen
  • Computer Science
  • 2007 22nd international symposium on computer and information sciences
  • 2007
Compact Fenwick trees for dynamic ranking and selection
A linear time algorithm for rolling binary trees
Compressed and Practical Data Structures for Strings


Word‐based text compression
  • A. Moffat
  • Computer Science
  • Softw. Pract. Exp.
  • 1989
Application of splay trees to data compression
Linear time adaptive arithmetic coding
  • A. Moffat
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1990
Arithmetic coding for data compression
Practical dictionary/arithmetic data compression synthesis
  • MSc Thesis
  • 1992
Word-based text compression', Software—Practice and Experience
  • Word-based text compression', Software—Practice and Experience
  • 1989