Optimizing search layouts in packed memory arrays

DOI10.1137/1.9781611977561.CH13MaRDI QIDQ6543558zbMATH OpenFDO

Authors Brian Wheatman, Randal Burns, Aydin Buluç, Helen Xu

Publication date 24 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977561.CH13

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Cache-Oblivious B-Trees
• scientific article; zbMATH DE number 2119642
• Array layouts for comparison-based searching
• Optimal worst-case operations for implicit cache-oblivious search trees.
• The cost of cache-oblivious searching

This page was built for publication: Optimizing search layouts in packed memory arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6543558)