Enhancing the B^+-tree by dynamic node popularity caching

DOI10.1016/J.IPL.2010.01.008zbMATH Open1209.68202OpenAlexW2081190572MaRDI QIDQ991779FDOQ991779

Authors: 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

Recommendations

• ISB-tree: A new indexing scheme with efficient expected behaviour
• Path conscious caching of \(B^{+}\) tree indexes in a shared disks cluster
• Algorithms and Computation
• On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation
• scientific article; zbMATH DE number 4211484

zbMATH Keywords

data structuresdatabases

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The buffer tree: A technique for designing batched external data structures
• Title not available (Why is that?)
• On Serial Files with Relocatable Records

Cited In (3)

• Path conscious caching of \(B^{+}\) tree indexes in a shared disks cluster
• CF-HNLBI: a new B-tree indexing for flash-based databases
• High Performance Computing for Computational Science - VECPAR 2004

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

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