Enhancing the \(B^{+}\)-tree by dynamic node popularity caching

DOI10.1016/J.IPL.2010.01.008zbMath1209.68202OpenAlexW2081190572MaRDI QIDQ991779

J. Martínez

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.01.008

zbMATH Keywords

data structuresdatabases

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Cites Work

• The buffer tree: A technique for designing batched external data structures
• On Serial Files with Relocatable Records
• Unnamed Item
• Unnamed Item

This page was built for publication: Enhancing the \(B^{+}\)-tree by dynamic node popularity caching