# A new data structure for cumulative frequency tables

@article{Fenwick1994AND, title={A new data structure for cumulative frequency tables}, author={P. Fenwick}, journal={Software: Practice and Experience}, year={1994}, volume={24} }

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

#### Topics from this paper

#### 184 Citations

A Constant Optimization of the Binary Indexed Tree Query Operation

- Mathematics, Computer Science
- ArXiv
- 2016

A Versatile and Efficient GPU Data Structure for Spatial Indexing

- Computer Science, Medicine
- IEEE Transactions on Visualization and Computer Graphics
- 2017

Implementing a Novel Data Structure for Maintaining Cumulative Frequency of Symbols

- Computer Science
- 2012

A new approach to adaptive encoding data using self-organizing data structures

- Computer Science
- 2007 22nd international symposium on computer and information sciences
- 2007

A linear time algorithm for rolling binary trees

- Computer Science, Mathematics
- IEEE EUROCON 2017 -17th International Conference on Smart Technologies
- 2017

#### References

SHOWING 1-6 OF 6 REFERENCES

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