A Cost Model for the Internal Organization of B+-Tree Nodes

Authors:
Wilfred J. Hansen
Affiliations:
Department of Computer Science, University of Pittsburgh, Pittsburgh, PA
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1981

Citing 6
Cited 4

Extendible hashing—a fast access method for dynamic files

ACM Transactions on Database Systems (TODS)
Prefix B-trees

ACM Transactions on Database Systems (TODS)
Search within a Page

Journal of the ACM (JACM)
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Analysis of design alternatives for virtual memory indexes

Communications of the ACM
A note on virtual memory indexes

Communications of the ACM

A compendium of key search references

ACM SIGIR Forum
B+ retake: sustaining high volume inserts into large data pages

Proceedings of the 4th ACM international workshop on Data warehousing and OLAP
B-tries for disk-based string management

The VLDB Journal — The International Journal on Very Large Data Bases
Redesigning the string hash table, burst trie, and BST to exploit cache

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract