Space efficient data structures for dynamic orthogonal range counting (Q390134)

\textit{Y. Nekrich} [Comput. Geom. 42, No. 4, 342--351 (2009; Zbl 1170.68012)] designed a data structure of a linear space with improved query time (cf. [\textit{B. Chazelle}, SIAM J. Comput. 17, No. 3, 427--462 (1988; Zbl 0679.68074)]). The authors study the problem of designing a linear space data structure that matches Nekrich's query time [loc. cit.] while providing a faster support for updates. The authors also obtain new results for the case in which the points are on a grid, and for supporting range counting on an integer sequence a succinct data structure also obtained.