Optimal pagination of B-trees with variable-length items
From MaRDI portal
Publication:3714476
DOI10.1145/357994.358025zbMath0587.68061MaRDI QIDQ3714476
Publication date: 1984
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/357994.358025
Related Items
Skip trees, an alternative data structure to skip lists in a concurrent approach, Algorithms for a hashed file with variable-length records