Publisher
Springer International Publishing
Reference20 articles.
1. Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. In: Proceedings of the SIGFIDET, pp. 107–141 (1970)
2. Bille, P., et al.: Dynamic relative compression, dynamic partial sums, and substring concatenation. Algorithmica 80(11), 3207–3224 (2018)
3. Blandford, D.K., Blelloch, G.E.: Compact representations of ordered sets. In: Proceedings of the SODA, pp. 11–19 (2004)
4. Comer, D.: The ubiquitous B-tree. ACM Comput. Surv. 11(2), 121–137 (1979)
5. Lecture Notes in Computer Science;ON Delpratt,2007