On the public citation graph

TheSB-tree an index-sequential structure for high-performance sequential access

0 signed · 53 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot

Organization and maintenance of large ordered indexes

inferredcites →https://doi.org/10.1007/bf00289145openalex-snapshot

Unsafe operations in B-trees

inferredcites →https://doi.org/10.1007/bf00289146openalex-snapshot

Expected behaviour of B+-trees under random insertions

inferredcites →https://doi.org/10.1145/320521.320530openalex-snapshot

Prefix B -trees

inferredcites →https://doi.org/10.1145/325096.325158openalex-snapshot

Maximizing performance in a striped disk array

inferredcites →https://doi.org/10.1145/325164.325158openalex-snapshot

Maximizing performance in a striped disk array

inferredcites →https://doi.org/10.1145/356770.356776openalex-snapshot

Ubiquitous B-Tree

inferredcites →https://doi.org/10.1145/38713.38755openalex-snapshot

The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time

inferredcites →https://doi.org/10.1145/38714.38755openalex-snapshot

The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time

inferredcites →https://doi.org/10.1145/49346.50067openalex-snapshot

A simple bounded disorder file organization with good performance

inferredcites →https://doi.org/10.1145/98457.98509openalex-snapshot

An evaluation of redundant arrays of disks using an Amdahl 5890

inferredcites →https://doi.org/10.1147/sj.232.0211openalex-snapshot

Managing IBM Database 2 buffers to maximize performance

inferredcites →https://doi.org/10.21236/ada631683openalex-snapshot

An Evaluation of Redundant Arrays of Disks using an Amdahl 5890

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-46146-9_92openalex-snapshot

Clustered Indexing Technique for Multidimensional Index Structures

inferred← citeshttps://doi.org/10.1007/978-3-030-26636-3_4openalex-snapshot

Graph Pattern Index for Neo4j Graph Databases

inferred← citeshttps://doi.org/10.1007/978-3-540-24571-1_3openalex-snapshot

Index Clustering for High-Performance Sequential Index Access

inferred← citeshttps://doi.org/10.1007/978-3-642-15364-8_31openalex-snapshot

Optimization of Disk Accesses for Multidimensional Range Queries

inferred← citeshttps://doi.org/10.1007/978-981-10-3023-9_16openalex-snapshot

The SP-tree: A Clustered Index Structure for Efficient Sequential Access

inferred← citeshttps://doi.org/10.1007/s002360050048openalex-snapshot

The log-structured merge-tree (LSM-tree)

inferred← citeshttps://doi.org/10.1007/s00778-005-0171-7openalex-snapshot

The partitioned exponential file for database storage management

inferred← citeshttps://doi.org/10.1007/s11280-022-01075-6openalex-snapshot

Optimizing subgraph matching over distributed knowledge graphs using partial evaluation

inferred← citeshttps://doi.org/10.1007/s13222-015-0204-3openalex-snapshot

Instant recovery with write-ahead logging

inferred← citeshttps://doi.org/10.1016/b978-012088469-8.50060-7openalex-snapshot

Write-Optimized B-Trees

inferred← citeshttps://doi.org/10.1016/j.jag.2025.104860openalex-snapshot

Geospatial grid management: A comprehensive framework and systematic review of subdivision, encoding, indexing and storage

inferred← citeshttps://doi.org/10.1016/j.jda.2010.08.001openalex-snapshot

ISB-tree: A new indexing scheme with efficient expected behaviour

inferred← citeshttps://doi.org/10.1109/greentech46478.2020.9289805openalex-snapshot

Hashed B-tree: Adaptive Performance Enhancement of B-tree on Byte-addressable Nonvolatile Memories

inferred← citeshttps://doi.org/10.1109/icde65706.2026.00072openalex-snapshot

LUCID: An Updatable and Concurrent Learned Index for Larger-Than-Memory Data Management

inferred← citeshttps://doi.org/10.1109/icdew.2011.5767655openalex-snapshot

‘Pause and resume’ functionality for index operations

inferred← citeshttps://doi.org/10.1109/tkde.2005.126openalex-snapshot

Finding patterns on protein surfaces: algorithms and applications to protein classification

inferred← citeshttps://doi.org/10.1145/1099554.1099699openalex-snapshot

Kalchas

inferred← citeshttps://doi.org/10.1145/1140402.1140409openalex-snapshot

B-tree indexes, interpolation search, and skew

inferred← citeshttps://doi.org/10.1145/1276301.1276302openalex-snapshot

Efficient columnar storage in B-trees

inferred← citeshttps://doi.org/10.1145/1363189.1363198openalex-snapshot

The five-minute rule twenty years later, and how flash memory changes the rules

inferred← citeshttps://doi.org/10.1145/1413254.1413264openalex-snapshot

The Five-Minute Rule 20 Years Later: and How Flash Memory Changes the Rules

inferred← citeshttps://doi.org/10.1145/1538788.1538805openalex-snapshot

The five-minute rule 20 years later (and how flash memory changes the rules)

inferred← citeshttps://doi.org/10.1145/2513591.2513656openalex-snapshot

On the efficiency of multiple range query processing in multidimensional data structures

inferred← citeshttps://doi.org/10.1145/2882903.2912569openalex-snapshot

Design Tradeoffs of Data Access Methods

inferred← citeshttps://doi.org/10.1145/301970.301973openalex-snapshot

The string B-tree

inferred← citeshttps://doi.org/10.1145/3282373.3282374openalex-snapshot

Graph Patterns Indexes

inferred← citeshttps://doi.org/10.1145/3323214openalex-snapshot

Multi-model Databases

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/384192.384193openalex-snapshot

External memory algorithms and data structures

inferred← citeshttps://doi.org/10.14778/2733085.2733094openalex-snapshot

BF-tree

inferred← citeshttps://doi.org/10.14778/3570690.3570704openalex-snapshot

FILM

inferred← citeshttps://doi.org/10.1561/0400000014openalex-snapshot

Algorithms and Data Structures for External Memory

inferred← citeshttps://doi.org/10.1561/1900000028openalex-snapshot

Modern B-Tree Techniques

inferred← citeshttps://doi.org/10.1561/1900000070openalex-snapshot

More Modern B-Tree Techniques

inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot

Algorithms and Data Structures for External Memory

inferred← citeshttps://doi.org/10.2200/s00617ed1v01y201411dtm039openalex-snapshot

Instant Recovery with Write-Ahead Logging: Page Repair, System Restart, and Media Restore

inferred← citeshttps://doi.org/10.2200/s00710ed2v01y201603dtm044openalex-snapshot

Instant Recovery with Write-Ahead Logging: Page Repair, System Restart, Media Restore, and System Failover, Second Edition

inferred← citeshttps://doi.org/10.5441/002/edbt.2016.42openalex-snapshot

Designing Access Methods: The RUM Conjecture

inferred← citeshttps://doi.org/10.5441/002/edbt.2017.80openalex-snapshot

Multi-model Data Management: What's New and What's Next?

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.