On the public citation graph
Some average performance measures for the B-tree
0 signed · 23 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00263762openalex-snapshot
Concurrency of operations on B-trees
inferredcites →https://doi.org/10.1007/bf00263927openalex-snapshot
Storage utilization in B *-trees with a generalized overflow technique
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1016/0306-4379(80)90064-2openalex-snapshot
Space utilization and access path length in B-trees
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_57openalex-snapshot
Maintaining dictionaries: Space-saving modifications of B-trees
inferred← citeshttps://doi.org/10.1007/bf00263500openalex-snapshot
A model of the dynamic behavior of B-trees
inferred← citeshttps://doi.org/10.1007/bf00289146openalex-snapshot
Expected behaviour of B+-trees under random insertions
inferred← citeshttps://doi.org/10.1007/bf00299632openalex-snapshot
Transforming Unbalanced Multiway trees into a practical external data structure
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00189-1openalex-snapshot
A uniform model for the storage utilization of B-tree-like structures
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90020-wopenalex-snapshot
B-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
inferred← citeshttps://doi.org/10.1016/0306-4379(89)90001-xopenalex-snapshot
An analysis of B-trees and their variants
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00125-iopenalex-snapshot
Space saving generalization of B-trees with 23 utilization
inferred← citeshttps://doi.org/10.1145/320435.320450openalex-snapshot
An efficient model for representing and analyzing B-trees
inferred← citeshttps://doi.org/10.1145/335191.335449openalex-snapshot
Making B+- trees cache conscious in main memory
inferred← citeshttps://doi.org/10.1145/342009.335449openalex-snapshot
Making B+- trees cache conscious in main memory
inferred← citeshttps://doi.org/10.1145/73721.73745openalex-snapshot
Utilization of B-trees with inserts, deletes and modifies
inferred← citeshttps://doi.org/10.14778/3626292.3626297openalex-snapshot
Breathing New Life into an Old Tree: Resolving Logging Dilemma of B + -tree on Modern Computational Storage Drives
inferred← citeshttps://doi.org/10.18419/opus-3589openalex-snapshot
Supporting multi-tenancy in Relational Database Management Systems for OLTP-style software as a service applications
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.