Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time

George Lagogiannis. Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time. Int. J. Found. Comput. Sci., 28(2):141-170, 2017. [doi]

Abstract

Abstract is missing.