Belga B-Trees

Belga B-Trees

Show other versions (2)

Abstract We revisitself-adjustingexternal memory tree data structures, which combine the optimal (and practical) worst-case I/O performances of B-trees, while adapting to the online distribution of queries. Our approach is analogous to undergoing efforts in the BST model, where Tango...

Full description

Bibliographic Details
Main Authors: Demaine, Erik D., Iacono, John, Koumoutsos, Grigorios, Langerman, Stefan
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: Springer US 2021
Online Access:https://hdl.handle.net/1721.1/136794

Internet

https://hdl.handle.net/1721.1/136794

Similar Items