The buffer tree: A technique for designing batched external data structures
From MaRDI portal
Publication:1424247
DOI10.1007/s00453-003-1021-xzbMath1058.68041OpenAlexW2088116875MaRDI QIDQ1424247
Publication date: 11 March 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-003-1021-x
Related Items
I/O-efficient algorithms for graphs of bounded treewidth ⋮ On dynamic bit-probe complexity ⋮ EXTERNAL MEMORY ORTHOGONAL RANGE REPORTING WITH FAST UPDATES ⋮ An I/O Efficient Algorithm for Minimum Spanning Trees ⋮ Unnamed Item ⋮ Certifying induced subgraphs in large graphs ⋮ An Almost Non-interactive Order Preserving Encryption Scheme ⋮ I/O-efficient algorithms for computing planar geometric spanners ⋮ The complexity of flow on fat terrains and its i/o-efficient computation ⋮ Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies ⋮ Enhancing the \(B^{+}\)-tree by dynamic node popularity caching ⋮ An Input/Output Efficient Algorithm for Hessenberg Reduction ⋮ I/O-efficient point location using persistent B-trees ⋮ Unnamed Item ⋮ Permuting and Batched Geometric Lower Bounds in the I/O Model ⋮ A Survey on Priority Queues ⋮ I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs ⋮ Unnamed Item ⋮ Inducing Suffix and LCP Arrays in External Memory ⋮ RAM-Efficient External Memory Sorting ⋮ Efficient computation of Lyapunov functions for Morse decompositions
