On the public citation graph

Main-memory index structures with fixed-size partial keys

0 signed · 86 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.1002/0471200611openalex-snapshot
Elements of Information Theory
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1080/09500349214551641openalex-snapshot
Elements of Information Theory
inferredcites →https://doi.org/10.1109/40.710872openalex-snapshot
Virtual memory in contemporary microprocessors
inferredcites →https://doi.org/10.1109/69.180602openalex-snapshot
Main memory database systems: an overview
inferredcites →https://doi.org/10.1109/69.180606openalex-snapshot
An evaluation of Starburst's memory resident storage component
inferredcites →https://doi.org/10.1109/69.591455openalex-snapshot
Block-oriented compression techniques for large statistical databases
inferredcites →https://doi.org/10.1109/icde.1998.655800openalex-snapshot
Compressing relations and indexes
inferredcites →https://doi.org/10.1145/129888.129896openalex-snapshot
Bit-Tree: a data structure for fast file processing
inferredcites →https://doi.org/10.1145/223982.224419openalex-snapshot
Reducing TLB and memory overhead using online superpage promotion
inferredcites →https://doi.org/10.1145/304181.304239openalex-snapshot
DataBlitz storage manager
inferredcites →https://doi.org/10.1145/304181.304244openalex-snapshot
In-memory data management for consumer transactions the timesten approach
inferredcites →https://doi.org/10.1145/304182.304239openalex-snapshot
DataBlitz storage manager
inferredcites →https://doi.org/10.1145/304182.304244openalex-snapshot
In-memory data management for consumer transactions the timesten approach
inferredcites →https://doi.org/10.1145/320521.320530openalex-snapshot
Prefix B -trees
inferredcites →https://doi.org/10.1145/335191.335449openalex-snapshot
Making B+- trees cache conscious in main memory
inferredcites →https://doi.org/10.1145/342009.335449openalex-snapshot
Making B+- trees cache conscious in main memory
inferredcites →https://doi.org/10.1145/602259.602261openalex-snapshot
Implementation techniques for main memory database systems
inferredcites →https://doi.org/10.7916/d8t441zbopenalex-snapshot
Cache Conscious Indexing for Decision-Support in Main Memory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11687238_15openalex-snapshot
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/11758532_85openalex-snapshot
Performance Analysis of the Cache Conscious-Generalized Search Tree
inferred← citeshttps://doi.org/10.1007/3-540-44843-8_54openalex-snapshot
An Enhanced Main Memory Index Structure Employing the Level Prefetching Technique
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_17openalex-snapshot
Cache-sensitive Memory Layout for Binary Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-13960-9_10openalex-snapshot
The DCB-Tree: A Space-Efficient Delta Coded Cache Conscious B-Tree
inferred← citeshttps://doi.org/10.1007/978-3-319-97841-3_3openalex-snapshot
World Model Representation
inferred← citeshttps://doi.org/10.1007/978-3-540-24768-5_93openalex-snapshot
An Efficient Cache Conscious Multi-dimensional Index Structure
inferred← citeshttps://doi.org/10.1007/978-3-540-30075-5_21openalex-snapshot
PCR-Tree: An Enhanced Cache Conscious Multi-dimensional Index Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-71703-4_35openalex-snapshot
CST-Trees: Cache Sensitive T-Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-74472-6_15openalex-snapshot
Cache Conscious Trees: How Do They Perform on Contemporary Commodity Microprocessors?
inferred← citeshttps://doi.org/10.1007/978-3-540-76414-4_33openalex-snapshot
An Efficient Compression Technique for a Multi-dimensional Index in Main Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-23397-5_16openalex-snapshot
Engineering a Multi-core Radix Sort
inferred← citeshttps://doi.org/10.1007/s00778-025-00950-8openalex-snapshot
An Evaluation of B-tree Compression Techniques
inferred← citeshttps://doi.org/10.1016/j.bdr.2015.11.003openalex-snapshot
FB + -tree for Big Data Management
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.06.017openalex-snapshot
An efficient cache conscious multi-dimensional index structure
inferred← citeshttps://doi.org/10.1016/j.ipm.2005.06.004openalex-snapshot
Performance of query processing implementations in ranking-based text retrieval systems using inverted indices
inferred← citeshttps://doi.org/10.1016/j.is.2023.102287openalex-snapshot
DB + -tree: A new variant of B + -tree for main-memory database systems
inferred← citeshttps://doi.org/10.1093/comjnl/bxv090openalex-snapshot
Cache-Sensitive Memory Layout for Dynamic Binary Trees
inferred← citeshttps://doi.org/10.1109/ceit.2016.7929035openalex-snapshot
Captree: Spatial and temporal indexing in databases from fixed sensors
inferred← citeshttps://doi.org/10.1109/icde.2004.1319989openalex-snapshot
Improving hash join performance through prefetching
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00040openalex-snapshot
$\mathrm{B}^{S}$-Tree: A Gapped Data-Parallel B-Tree
inferred← citeshttps://doi.org/10.1109/isca45697.2020.00033openalex-snapshot
Bonsai: High-Performance Adaptive Merge Tree Sorting
inferred← citeshttps://doi.org/10.1109/mcsoc2018.2018.00041openalex-snapshot
Design and Evaluation of a Configurable Hardware Merge Sorter for Various Output Records
inferred← citeshttps://doi.org/10.1109/tkde.2004.1318568openalex-snapshot
Main Memory Indexing: The Case for BD-Tree
inferred← citeshttps://doi.org/10.1109/tkde.2005.46openalex-snapshot
Indexing high-dimensional data for efficient in-memory similarity search
inferred← citeshttps://doi.org/10.1109/tkde.2007.190616openalex-snapshot
Adaptive Index Utilization in Memory-Resident Structural Joins
inferred← citeshttps://doi.org/10.1145/1031171.1031209openalex-snapshot
Scalable sequential pattern mining for biological sequences
inferred← citeshttps://doi.org/10.1145/1114252.1114254openalex-snapshot
Multithreaded architectures and the sort benchmark
inferred← citeshttps://doi.org/10.1145/1183614.1183717openalex-snapshot
Cache-oblivious nested-loop joins
inferred← citeshttps://doi.org/10.1145/1363189.1363193openalex-snapshot
A general framework for improving query processing performance on multi-level memory hierarchies
inferred← citeshttps://doi.org/10.1145/1366102.1366105openalex-snapshot
Cache-oblivious databases
inferred← citeshttps://doi.org/10.1145/1559845.1559877openalex-snapshot
Dictionary-based order-preserving string compression for main memory column stores
inferred← citeshttps://doi.org/10.1145/1807167.1807206openalex-snapshot
FAST
inferred← citeshttps://doi.org/10.1145/1807167.1807207openalex-snapshot
Fast sort on CPUs and GPUs
inferred← citeshttps://doi.org/10.1145/2043652.2043655openalex-snapshot
Designing fast architecture-sensitive tree search on modern multicore/many-core processors
inferred← citeshttps://doi.org/10.1145/2168836.2168855openalex-snapshot
Cache craftiness for fast multicore key-value storage
inferred← citeshttps://doi.org/10.1145/2621934.2621941openalex-snapshot
GRATIN
inferred← citeshttps://doi.org/10.1145/3267809.3267824openalex-snapshot
An Efficient Memory-Mapped Key-Value Store for Flash Storage
inferred← citeshttps://doi.org/10.1145/3409963.3410496openalex-snapshot
SIndex
inferred← citeshttps://doi.org/10.1145/3418414openalex-snapshot
Kreon
inferred← citeshttps://doi.org/10.1145/3472883.3487012openalex-snapshot
Parallax
inferred← citeshttps://doi.org/10.1145/3649329.3657385openalex-snapshot
LIVAK: A High-Performance In-Memory Learned Index for Variable-Length Keys
inferred← citeshttps://doi.org/10.1145/3654972openalex-snapshot
Revisiting B-tree Compression: An Experimental Study
inferred← citeshttps://doi.org/10.1145/3707641openalex-snapshot
HLN-Tree: A memory-efficient B+-Tree with huge leaf nodes and locality predictors
inferred← citeshttps://doi.org/10.1145/375663.375688openalex-snapshot
Improving index performance through prefetching
inferred← citeshttps://doi.org/10.1145/376284.375688openalex-snapshot
Improving index performance through prefetching
inferred← citeshttps://doi.org/10.1145/563932.563925openalex-snapshot
Compacting discriminator information for spatial trees
inferred← citeshttps://doi.org/10.1145/564691.564710openalex-snapshot
Fractal prefetching B + -Trees
inferred← citeshttps://doi.org/10.1145/564691.564753openalex-snapshot
A compact B-tree
inferred← citeshttps://doi.org/10.1145/781027.781063openalex-snapshot
Effect of node size on the performance of cache-conscious B + -trees
inferred← citeshttps://doi.org/10.1145/872757.872815openalex-snapshot
Contorting high dimensional data for efficient main memory KNN processing
inferred← citeshttps://doi.org/10.1145/885651.781063openalex-snapshot
Effect of node size on the performance of cache-conscious B + -trees
inferred← citeshttps://doi.org/10.1184/r1/6606149openalex-snapshot
Hot DB'02 course project reports : hot topics in database systems, fall 2002
inferred← citeshttps://doi.org/10.14711/thesis-b1029228openalex-snapshot
Cache-oblivious query processing
inferred← citeshttps://doi.org/10.2139/ssrn.4876187openalex-snapshot
Fir: Achieving High Throughput and Fast Recovery in Non-Volatile Memory Oltp Engine
inferred← citeshttps://doi.org/10.2197/ipsjdc.2.25openalex-snapshot
Array-based Cache Conscious Trees
inferred← citeshttps://doi.org/10.24406/publica-fhg-295097openalex-snapshot
Faster Radix Sort via Virtual Memory and Write-Combining
inferred← citeshttps://doi.org/10.3166/geo.19.133-150openalex-snapshot
Gestion de masses de données au sein de bases de données capteurs
inferred← citeshttps://doi.org/10.3311/pp.ee.2010-3-4.06openalex-snapshot
In-memory preprocessing of streaming sensory data - a partitioned relational database approach
inferred← citeshttps://doi.org/10.3390/electronics14010039openalex-snapshot
FIR: Achieving High Throughput and Fast Recovery in a Non-Volatile Memory Online Transaction Processing Engine
inferred← citeshttps://doi.org/10.3745/jips.2008.4.1.009openalex-snapshot
Two-Tier Storage DBMS for High-Performance Query Processing
inferred← citeshttps://doi.org/10.3745/kipstd.2007.14-d.1.021openalex-snapshot
CC-GiST: A Generalized Framework for Efficiently Implementing Arbitrary Cache-Conscious Search Trees
inferred← citeshttps://doi.org/10.4018/jdm.305732openalex-snapshot
Index Key Compression and On-the-Fly Reconstruction of In-Memory Indexes
inferred← citeshttps://doi.org/10.48550/arxiv.2009.11543openalex-snapshot
Compressed Key Sort and Fast Index Reconstruction
inferred← citeshttps://doi.org/10.48550/arxiv.2106.03840openalex-snapshot
Balancing Garbage Collection vs I/O Amplification using hybrid Key-Value Placement in LSM-based Key-Value Stores
inferred← citeshttps://doi.org/10.6688/jise.2011.27.1.10openalex-snapshot
Making T-Trees Cache Conscious on Commodity Microprocessors *
inferred← citeshttps://doi.org/10.7916/d8057ps0openalex-snapshot
Improving Database Performance on Simultaneous Multithreading Processors
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.