On the public citation graph
Expected behaviour of B+-trees under random insertions
0 signed · 56 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/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.1007/bf00289710openalex-snapshot
Some average performance measures for the B-tree
inferredcites →https://doi.org/10.1007/bf02418571openalex-snapshot
Sur les fonctions convexes et les inégalités entre les valeurs moyennes
inferredcites →https://doi.org/10.1016/0020-0190(79)90127-3openalex-snapshot
Some observations on random 2–3 trees
inferredcites →https://doi.org/10.1016/0020-0190(84)90085-1openalex-snapshot
Approximate storage utilisation of B-trees: A simple derivation and generalisations
inferredcites →https://doi.org/10.1016/0020-0190(86)90101-8openalex-snapshot
Approximate storage utilization of B-trees
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.1016/s0019-9958(82)90534-4openalex-snapshot
The theory of fringe analysis and its application to 23 trees and b-trees
inferredcites →https://doi.org/10.1080/00029890.1982.11995446openalex-snapshot
Kantorovich-Type Inequalities
inferredcites →https://doi.org/10.1093/comjnl/28.4.417openalex-snapshot
The Analysis of an Improved Symmetric Binary B-tree Algorithm
inferredcites →https://doi.org/10.1145/1734714.1734731openalex-snapshot
Binary B-trees for virtual memory
inferredcites →https://doi.org/10.1145/359810.359839openalex-snapshot
Pagination of B*-trees with variable-length records
inferredcites →https://doi.org/10.1145/602259.602265openalex-snapshot
An empirical comparison of B-trees, compact B-trees and multiway trees
inferredcites →https://doi.org/10.1145/971697.602265openalex-snapshot
An empirical comparison of B-trees, compact B-trees and multiway 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/11546924_20openalex-snapshot
Adaptive Query Processing in Point-Transformation Schemes
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_35openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_10openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_70openalex-snapshot
Analysis of bounded disorder
inferred← citeshttps://doi.org/10.1007/bf00276022openalex-snapshot
Modeling splits in file structures
inferred← citeshttps://doi.org/10.1007/bf01185680openalex-snapshot
TheSB-tree an index-sequential structure for high-performance sequential access
inferred← citeshttps://doi.org/10.1007/bf01186643openalex-snapshot
Variance of storage requirements for B+-trees
inferred← citeshttps://doi.org/10.1007/bfb0022161openalex-snapshot
An adaptive overflow technique for B-trees
inferred← citeshttps://doi.org/10.1007/s11771-999-0037-zopenalex-snapshot
Sequential retrieval of B-trees and a file structure with a dense B-tree index
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/0306-4379(90)90024-jopenalex-snapshot
A dynamic storage allocation algorithm suitable for file structures
inferred← citeshttps://doi.org/10.1016/j.datak.2006.08.001openalex-snapshot
Processing partially specified queries over high-dimensional databases
inferred← citeshttps://doi.org/10.1016/s0169-023x(02)00023-xopenalex-snapshot
A retrieval technique for high-dimensional data and partially specified queries
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00061-8openalex-snapshot
Bounded disorder: The effect of the index
inferred← citeshttps://doi.org/10.1017/s0269964800003776openalex-snapshot
Toward a Formal Derivation of the Expected Behavior of Prefix B-Trees
inferred← citeshttps://doi.org/10.1109/69.634758openalex-snapshot
Probabilistic model and optimal reorganization of B/sup +/-tree with physical clustering
inferred← citeshttps://doi.org/10.1109/69.87964openalex-snapshot
Performance of B/sup +/-trees with partial expansions
inferred← citeshttps://doi.org/10.1109/ideas.2000.880576openalex-snapshot
Bulk loading a data warehouse built upon a UB-Tree
inferred← citeshttps://doi.org/10.1109/ideas.2001.938071openalex-snapshot
Implementing KDB-trees to support high-dimensional data
inferred← citeshttps://doi.org/10.1109/ideas.2002.1029652openalex-snapshot
Interval processing with the UB-Tree
inferred← citeshttps://doi.org/10.1109/jcit.1990.128265openalex-snapshot
An interleaved file system for a highly distributed MIMD architecture
inferred← citeshttps://doi.org/10.1109/tkde.2003.1198400openalex-snapshot
Persistently cached B-trees
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/202660.202666openalex-snapshot
Implementing deletion in B+-trees
inferred← citeshttps://doi.org/10.1145/315891.315901openalex-snapshot
Performance analysis of a periodic data reorganization algorithm for concurrent Blink-trees in database systems
inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferred← citeshttps://doi.org/10.1561/0400000014openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
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
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5192openalex-snapshot
Modeling of Physical Database Design and Performance Analysis With Emphasis on VSAM Files.
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.