STORAGE OVERHEAD OF O-TREES, B-TREES AND PREFIX B-TREES: A COMPARATIVE ANALYSIS

DOI10.1142/S0129054196000166zbMath0859.68017OpenAlexW1987887509MaRDI QIDQ5687657

Hosam M. Mahmoud, Ratko Orlandic

Publication date: 10 April 1997

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054196000166

zbMATH Keywords

O-treeprefix \(B\)-trees

Mathematics Subject Classification ID

Database theory (68P15)

This page was built for publication: STORAGE OVERHEAD OF O-TREES, B-TREES AND PREFIX B-TREES: A COMPARATIVE ANALYSIS