implementing bp_support with update operation

[redrattus]

Hi, Is there any effort to implement a bp_support with an update operation? Actually, I wish to contribute it because SDSL doesn't support yet. To this end, I am now modifying the bp_support_sada as basis in which two more data structures (i.e., trees) are added. m_sml_block_size and m_med_block size to keep the bit length of each small block and medium block being maintaing, respectively. Further, I modify the rank and select operation to support a update operation in the same manner.

Would you give me a guideline to best way to implement it?

[simongog]

Hi Junho, great that you plan to contribute. At the moment there are not yet dynamic versions of all bp_support structures and adding dynamic versions is highly appreciated. What is the time complexity of adding parentheses (=nodes) to the structure in your proposal?There is a proposal from SEA 2012 (Stelios Joannou, Rajeev Raman: Dynamizing Succinct Tree Representations. SEA 2012: 224-235), are you aware of it?

[redrattus]

Yes I aware of it. But, I indeed refer Fully-Functional Static and Dynamic Succinct Trees [Gonzalo Navarro, Kunihiko Sadakane]. But the problem is that the memory management.