On the public citation graph
Modern B-Tree Techniques
0 signed · 241 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.1002/(sici)1097-024x(199604)26:4<427::aid-spe20>3.0.co;2-hopenalex-snapshot
Iterators, Schedulers, and Distributed-memory Parallelism
inferredcites →https://doi.org/10.1007/3-540-07410-4_645openalex-snapshot
Implementierung von Zugriffspfaden durch Bitlisten
inferredcites →https://doi.org/10.1007/3-540-08755-9_9openalex-snapshot
Notes on data base operating systems
inferredcites →https://doi.org/10.1007/3-540-51085-0_42openalex-snapshot
MODEL 204 architecture and performance
inferredcites →https://doi.org/10.1007/3-540-63343-x_48openalex-snapshot
The universal B-tree for multidimensional indexing: General concepts
inferredcites →https://doi.org/10.1007/978-3-642-03573-9_4openalex-snapshot
The Real Performance Drivers behind XML Lock Protocols
inferredcites →https://doi.org/10.1007/978-3-642-10631-6_84openalex-snapshot
Deletion without Rebalancing in Multiway Search Trees
inferredcites →https://doi.org/10.1007/978-3-642-69672-5openalex-snapshot
Data Structures and Algorithms 1
inferredcites →https://doi.org/10.1007/978-3-642-70288-4openalex-snapshot
Fehlererkennung und Fehlerbehandlung in Speicherungsstrukturen von Datenbanksystemen
inferredcites →https://doi.org/10.1007/bf00263762openalex-snapshot
Concurrency of operations on B-trees
inferredcites →https://doi.org/10.1007/bf00288534openalex-snapshot
An algorithmic and complexity analysis of interpolation search
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf01185680openalex-snapshot
TheSB-tree an index-sequential structure for high-performance sequential access
inferredcites →https://doi.org/10.1007/bf01354877openalex-snapshot
Alphasort: A cache-sensitive parallel external sort
inferredcites →https://doi.org/10.1007/bf01840450openalex-snapshot
An evaluation of buffer management strategies for relational database systems
inferredcites →https://doi.org/10.1007/bfb0022162openalex-snapshot
Single table access using multiple indexes: Optimization, execution, and concurrency control techniques
inferredcites →https://doi.org/10.1007/bfb0032438openalex-snapshot
Performance of on-line index construction algorithms
inferredcites →https://doi.org/10.1007/s00450-007-0022-4openalex-snapshot
Master-detail clustering using merged indexes
inferredcites →https://doi.org/10.1007/s00778-004-0140-6openalex-snapshot
Concurrency control and recovery for balanced B-link trees
inferredcites →https://doi.org/10.1007/s007780050004openalex-snapshot
The LHAM log-structured history data access method
inferredcites →https://doi.org/10.1007/s007780050043openalex-snapshot
S eek ing the truth about ad hoc join costs
inferredcites →https://doi.org/10.1016/b978-012088469-8.50006-1openalex-snapshot
On the Performance of Bitmap Indices for High Cardinality Attributes
inferredcites →https://doi.org/10.1016/b978-012088469-8.50060-7openalex-snapshot
Write-Optimized B-Trees
inferredcites →https://doi.org/10.1016/b978-012722442-8/50043-4openalex-snapshot
Buffering Accesses to Memory-Resident Index Structures
inferredcites →https://doi.org/10.1023/a:1013764014000openalex-snapshot
Merging R-Trees: Efficient Strategies for Local Bulk Insertion
inferredcites →https://doi.org/10.1109/dcc.1993.253116openalex-snapshot
Sort order preserving data compression for extended alphabets
inferredcites →https://doi.org/10.1109/dsn.2008.4630121openalex-snapshot
Analyzing the effects of disk-pointer corruption
inferredcites →https://doi.org/10.1109/icde.1991.131464openalex-snapshot
An efficient hybrid join algorithm: a DB2 prototype
inferredcites →https://doi.org/10.1109/icde.1995.380378openalex-snapshot
Disk read-write optimizations and data integrity in transaction systems using write-ahead logging
inferredcites →https://doi.org/10.1109/icde.2001.914847openalex-snapshot
B-tree indexes and CPU caches
inferredcites →https://doi.org/10.1109/icde.2001.914869openalex-snapshot
Discovery and application of check constraints in DB2
inferredcites →https://doi.org/10.1109/icde.2004.1319981openalex-snapshot
Simple, robust and highly concurrent b-trees with node deletion
inferredcites →https://doi.org/10.1109/icde.2006.150openalex-snapshot
Super-Scalar RAM-CPU Cache Compression
inferredcites →https://doi.org/10.1109/icde.2007.367848openalex-snapshot
Adaptively Reordering Joins during Query Execution
inferredcites →https://doi.org/10.1145/1007568.1007606openalex-snapshot
Transaction support for indexed summary views
inferredcites →https://doi.org/10.1145/1071610.1071615openalex-snapshot
Making snapshot isolation serializable
inferredcites →https://doi.org/10.1145/1132863.1132864openalex-snapshot
Optimizing bitmap indices with efficient compression
inferredcites →https://doi.org/10.1145/1132956.1132959openalex-snapshot
Inverted files for text search engines
inferredcites →https://doi.org/10.1145/1132960.1132964openalex-snapshot
Implementing sorting in database systems
inferredcites →https://doi.org/10.1145/1140402.1140409openalex-snapshot
B-tree indexes, interpolation search, and skew
inferredcites →https://doi.org/10.1145/1247480.1247525openalex-snapshot
How to barter bits for chronons
inferredcites →https://doi.org/10.1145/1276301.1276302openalex-snapshot
Efficient columnar storage in B-trees
inferredcites →https://doi.org/10.1145/1292609.1292616openalex-snapshot
An adaptive packed-memory array
inferredcites →https://doi.org/10.1145/130283.130337openalex-snapshot
Algorithms for creating indexes for very large tables without quiescing updates
inferredcites →https://doi.org/10.1145/130283.130338openalex-snapshot
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
inferredcites →https://doi.org/10.1145/1386118.1386125openalex-snapshot
Efficient online index construction for text databases
inferredcites →https://doi.org/10.1145/1409360.1409379openalex-snapshot
Technical perspectiveOne size fits all
inferredcites →https://doi.org/10.1145/1409360.1409380openalex-snapshot
Breaking the memory wall in MonetDB
inferredcites →https://doi.org/10.1145/1413254.1413264openalex-snapshot
The Five-Minute Rule 20 Years Later: and How Flash Memory Changes the Rules
inferredcites →https://doi.org/10.1145/152610.152611openalex-snapshot
Query evaluation techniques for large databases
inferredcites →https://doi.org/10.1145/1538788.1538805openalex-snapshot
The five-minute rule 20 years later (and how flash memory changes the rules)
inferredcites →https://doi.org/10.1145/163090.163100openalex-snapshot
Options in physical database design
inferredcites →https://doi.org/10.1145/16856.16886openalex-snapshot
Spatial query processing in an object-oriented database system
inferredcites →https://doi.org/10.1145/1734663.1734671openalex-snapshot
Organization and maintenance of large ordered indices
inferredcites →https://doi.org/10.1145/1739041.1739087openalex-snapshot
Self-selecting, self-tuning, incrementally optimized indexes
inferredcites →https://doi.org/10.1145/1806907.1806908openalex-snapshot
A survey of B-tree locking techniques
inferredcites →https://doi.org/10.1145/211990.212001openalex-snapshot
Multi-table joins through bitmapped join indices
inferredcites →https://doi.org/10.1145/223784.223785openalex-snapshot
A critique of ANSI SQL isolation levels
inferredcites →https://doi.org/10.1145/271074.271094openalex-snapshot
The five-minute rule ten years later, and other computer storage rules of thumb
inferredcites →https://doi.org/10.1145/289.291openalex-snapshot
Principles of transaction-oriented database recovery
inferredcites →https://doi.org/10.1145/290593.290598openalex-snapshot
B-tree page size when caching is considered
inferredcites →https://doi.org/10.1145/319628.319663openalex-snapshot
Efficient locking for concurrent operations on B-trees
inferredcites →https://doi.org/10.1145/319983.319987openalex-snapshot
Duplicate record elimination in large data files
inferredcites →https://doi.org/10.1145/320263.320284openalex-snapshot
Implementing a generalized access path structure for a relational database system
inferredcites →https://doi.org/10.1145/322234.322238openalex-snapshot
Using Semi-Joins to Solve Relational Queries
inferredcites →https://doi.org/10.1145/322358.322363openalex-snapshot
Locking Primitives in a Database System
inferredcites →https://doi.org/10.1145/335191.335449openalex-snapshot
Making B+- trees cache conscious in main memory
inferredcites →https://doi.org/10.1145/358699.358703openalex-snapshot
Operating system support for database management
inferredcites →https://doi.org/10.1145/359545.359557openalex-snapshot
Interpolation search—a log log N search
inferredcites →https://doi.org/10.1145/360363.360369openalex-snapshot
The notions of consistency and predicate locks in a database system
inferredcites →https://doi.org/10.1145/362875.362901openalex-snapshot
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]
inferredcites →https://doi.org/10.1145/582095.582099openalex-snapshot
Access path selection in a relational database management system
inferredcites →https://doi.org/10.1145/603867.603878openalex-snapshot
The evolution of effective B-tree
inferredcites →https://doi.org/10.1145/63320.66509openalex-snapshot
Storage management for objects in EXODUS
inferredcites →https://doi.org/10.1145/73721.73745openalex-snapshot
Utilization of B-trees with inserts, deletes and modifies
inferredcites →https://doi.org/10.1145/781027.781063openalex-snapshot
Effect of node size on the performance of cache-conscious B + -trees
inferredcites →https://doi.org/10.1147/rd.482.0255openalex-snapshot
The performance impact of I/O optimizations and disk improvements
inferredcites →https://doi.org/10.5555/1182635.1164201openalex-snapshot
How to wring a table dry: entropy compression of relations and querying of compressed relations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4614-6856-1_4openalex-snapshot
Web-Scale Analytics for BIG Data
inferred← citeshttps://doi.org/10.1007/978-3-030-74296-6_5openalex-snapshot
A File-Based Linked Data Fragments Approach to Prefix Search
inferred← citeshttps://doi.org/10.1007/978-3-031-01873-2_1openalex-snapshot
On Transactional Concurrency Control
inferred← citeshttps://doi.org/10.1007/978-3-031-01873-2_6openalex-snapshot
Orthogonal Key-Value Locking
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_24openalex-snapshot
Space-Efficient B Trees via Load-Balancing
inferred← citeshttps://doi.org/10.1007/978-3-031-17715-6_21openalex-snapshot
A Verified Implementation of B$$^+$$-Trees in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-031-29576-8_2openalex-snapshot
BoDS: A Benchmark on Data Sortedness
inferred← citeshttps://doi.org/10.1007/978-3-031-41673-6_9openalex-snapshot
Parallel-Batched Interpolation Search Tree
inferred← citeshttps://doi.org/10.1007/978-3-031-59107-5_5openalex-snapshot
Analyzing the Performance: B-trees vs. Red-Black Trees with Caching Strategies
inferred← citeshttps://doi.org/10.1007/978-3-031-74097-8_5openalex-snapshot
MxKernel: A Bare-Metal Runtime System for Database Operations on Heterogeneous Many-Core Hardware
inferred← citeshttps://doi.org/10.1007/978-3-031-74097-8_8openalex-snapshot
Scalable Data Management on Next-Generation Data Center Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-97119-8_10openalex-snapshot
Stordy: Efficient Data Retrieval and Storage for Appendable-Block Blockchains
inferred← citeshttps://doi.org/10.1007/978-3-032-32023-0_54openalex-snapshot
When Indexes Work: Optimizing SQL Queries for Low-Code Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_10openalex-snapshot
Bulk Operations on B-Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_11openalex-snapshot
Online Index Construction and Maintenance
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_12openalex-snapshot
Concurrency Control by Versioning
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_13openalex-snapshot
Distributed Transactions
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_14openalex-snapshot
Transactions in Page-Server Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_15openalex-snapshot
Processing of Write-Intensive Transactions
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_2openalex-snapshot
Operations on the Physical Database
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_4openalex-snapshot
Transaction Rollback and Restart Recovery
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_6openalex-snapshot
Lock-Based Concurrency Control
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_8openalex-snapshot
B-Tree Structure Modifications
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_9openalex-snapshot
Advanced Locking Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-30936-1_13openalex-snapshot
Pointlessness is Better than Listlessness
inferred← citeshttps://doi.org/10.1007/978-3-319-59427-9_3openalex-snapshot
Experimental Performance Analysis of B+-Trees with Big Data Indexing Potentials
inferred← citeshttps://doi.org/10.1007/978-3-642-25731-5_24openalex-snapshot
Deferred Maintenance of Indexes and of Materialized Views
inferred← citeshttps://doi.org/10.1007/978-981-13-0869-7_13openalex-snapshot
School Mapping for Schools of Basic Education in Myanmar
inferred← citeshttps://doi.org/10.1007/978-981-97-0798-0_14openalex-snapshot
A Cross-Chain System Supports Verifiable Complete Data Provenance Queries
inferred← citeshttps://doi.org/10.1007/s00224-025-10238-7openalex-snapshot
Space-Efficient B Trees via Load-Balancing
inferred← citeshttps://doi.org/10.1007/s00778-013-0345-7openalex-snapshot
Transactional support for adaptive indexing
inferred← citeshttps://doi.org/10.1007/s00778-018-0507-8openalex-snapshot
Smooth Scan: robust access path selection without cardinality estimation
inferred← citeshttps://doi.org/10.1007/s00778-020-00638-1openalex-snapshot
Comparison and evaluation of state-of-the-art LSM merge policies
inferred← citeshttps://doi.org/10.1007/s00778-024-00858-9openalex-snapshot
A survey on hybrid transactional and analytical processing
inferred← citeshttps://doi.org/10.1007/s00778-025-00950-8openalex-snapshot
An Evaluation of B-tree Compression Techniques
inferred← citeshttps://doi.org/10.1007/s10619-015-7175-0openalex-snapshot
Chronos: a NoSQL system on flash memory for industrial process data
inferred← citeshttps://doi.org/10.1007/s10619-021-07326-1openalex-snapshot
PatchIndex: exploiting approximate constraints in distributed databases
inferred← citeshttps://doi.org/10.1007/s11042-021-10800-8openalex-snapshot
A novel approach to perform context‐based automatic spoken document retrieval of political speeches based on wavelet tree indexing
inferred← citeshttps://doi.org/10.1007/s11280-016-0426-9openalex-snapshot
Tide-tree: A self-tuning indexing scheme for hybrid storage system
inferred← citeshttps://doi.org/10.1007/s13222-022-00409-yopenalex-snapshot
B2-Tree: Page-Based String Indexing in Concurrent Environments
inferred← citeshttps://doi.org/10.1007/s41019-025-00325-7openalex-snapshot
SieveJoin: Boosting Multi-way Joins by Filtering Unneeded Intermediate Results
inferred← citeshttps://doi.org/10.1007/s42514-024-00204-zopenalex-snapshot
GreenB+Tree: an energy-efficient B+tree for MIMD architectures
inferred← citeshttps://doi.org/10.1016/j.is.2022.102144openalex-snapshot
Multi-valued indexing in Apache AsterixDB (SI DOLAP 2022)
inferred← citeshttps://doi.org/10.1016/j.procir.2021.11.279openalex-snapshot
Quality Monitoring of Manufacturing Processes based on Full Data Utilization
inferred← citeshttps://doi.org/10.1093/comjnl/bxv090openalex-snapshot
Cache-Sensitive Memory Layout for Dynamic Binary Trees
inferred← citeshttps://doi.org/10.1103/v557-qqqlopenalex-snapshot
Resolving the blueshift in calculations of the EUV spectrum of multiply charged tin ions
inferred← citeshttps://doi.org/10.1109/access.2025.3577461openalex-snapshot
Smart Chaining: Templing and Temple Search
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9006240openalex-snapshot
Experimental Evaluation of Bounded-Depth LSM Merge Policies
inferred← citeshttps://doi.org/10.1109/estream70144.2026.11511512openalex-snapshot
A Generalized Method for Cursor-Based Pagination in Heterogeneous Database Systems
inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00071openalex-snapshot
SineKV: Decoupled Secondary Indexing for LSM-based Key-Value Stores
inferred← citeshttps://doi.org/10.1109/icde.2015.7113294openalex-snapshot
Smooth Scan: Statistics-oblivious access paths
inferred← citeshttps://doi.org/10.1109/icde.2015.7113359openalex-snapshot
Dynamic physiological partitioning on a shared-nothing database cluster
inferred← citeshttps://doi.org/10.1109/icde.2019.00079openalex-snapshot
Packed Memory Arrays - Rewired
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00107openalex-snapshot
Airphant: Cloud-oriented Document Indexing
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00117openalex-snapshot
Indexing for Near-Sorted Data
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00238openalex-snapshot
Graphix: “One User's JSON is Another User's Graph”
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/icdew61823.2024.00051openalex-snapshot
An Empirical Evaluation of Variable-length Record B+Trees on a Modern Graph Database System
inferred← citeshttps://doi.org/10.1109/icecmsn68058.2025.11383397openalex-snapshot
Efficient Indexing for OLTP Workloads: A Rule-based Approach for PostgreSQL
inferred← citeshttps://doi.org/10.1109/ickii55100.2022.9983552openalex-snapshot
Extendable B-tree on Multi-channel Nonvolatile Memory Devices
inferred← citeshttps://doi.org/10.1109/icraie47735.2019.9037757openalex-snapshot
Performance Evaluation of Inverted Files, B-Tree and B+ Tree Indexing Algorithm on Malay Text
inferred← citeshttps://doi.org/10.1109/icse48619.2023.00174openalex-snapshot
Testing Database Engines via Query Plan Guidance
inferred← citeshttps://doi.org/10.1109/ieecon68065.2026.11707090openalex-snapshot
HSM-Based Workload Similarity Analysis for Temporal Database Indexing
inferred← citeshttps://doi.org/10.1109/infocom59046.2026.11571213openalex-snapshot
Foresight Indexing: Accelerating B+tree Index with Programmable Switches on the Network Path
inferred← citeshttps://doi.org/10.1109/ivmem57067.2022.9983963openalex-snapshot
Multi-versioned log-structured index
inferred← citeshttps://doi.org/10.1109/ocit65031.2024.00143openalex-snapshot
Implementation of a Faster B+ Tree*
inferred← citeshttps://doi.org/10.1109/tcad.2024.3443702openalex-snapshot
Search-in-Memory: Reliable, Versatile, and Efficient Data Matching in SSD’s NAND Flash Memory Chip for Data Indexing Acceleration
inferred← citeshttps://doi.org/10.1109/tcc.2026.3672997openalex-snapshot
Faunus: A Non-Blocking Distributed B + Tree Index for RDMA-Based Disaggregated Memory
inferred← citeshttps://doi.org/10.1109/tpds.2019.2942918openalex-snapshot
A High Throughput B+tree for SIMD Architectures
inferred← citeshttps://doi.org/10.1109/tpds.2025.3646133openalex-snapshot
Optimizing Management of Persistent Data Structures in High-Performance Analytics
inferred← citeshttps://doi.org/10.1137/1.9781611976465.135openalex-snapshot
Competitive Data-Structure Dynamization
inferred← citeshttps://doi.org/10.1145/2485732.2485747openalex-snapshot
Extending SSD lifetime in database applications with page overwrites
inferred← citeshttps://doi.org/10.1145/2699484openalex-snapshot
Online Updates on Data Warehouses via Judicious Use of Solid-State Storage
inferred← citeshttps://doi.org/10.1145/2882903.2882918openalex-snapshot
A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms
inferred← citeshttps://doi.org/10.1145/2882903.2912569openalex-snapshot
Design Tradeoffs of Data Access Methods
inferred← citeshttps://doi.org/10.1145/2933349.2933352openalex-snapshot
The ART of practical synchronization
inferred← citeshttps://doi.org/10.1145/3035918.3064049openalex-snapshot
Access Path Selection in Main-Memory Optimized Data Systems
inferred← citeshttps://doi.org/10.1145/3132847.3132935openalex-snapshot
Covering the Optimal Time Window Over Temporal Data
inferred← citeshttps://doi.org/10.1145/3151759.3151814openalex-snapshot
Write-optimized indexing with partitioned b-trees
inferred← citeshttps://doi.org/10.1145/3209210openalex-snapshot
Algorithms behind modern storage systems
inferred← citeshttps://doi.org/10.1145/3212477.3220266openalex-snapshot
Algorithms Behind Modern Storage Systems
inferred← citeshttps://doi.org/10.1145/3282373.3282402openalex-snapshot
Efficient Data and Indexing Structure for Blockchains in Enterprise Systems
inferred← citeshttps://doi.org/10.1145/3299869.3319861openalex-snapshot
Designing Succinct Secondary Indexing Mechanism by Exploiting Column Correlations
inferred← citeshttps://doi.org/10.1145/3318464.3389711openalex-snapshot
ALEX: An Updatable Adaptive Learned Index
inferred← citeshttps://doi.org/10.1145/3327964.3328497openalex-snapshot
Fast Concurrent Reads and Updates with PMAs
inferred← citeshttps://doi.org/10.1145/3400903.3400907openalex-snapshot
Efficient Search over Genomic Short Read Data
inferred← citeshttps://doi.org/10.1145/3428279openalex-snapshot
Finding bugs in database systems via query partitioning
inferred← citeshttps://doi.org/10.1145/3533702.3534917openalex-snapshot
Micro-architectural analysis of a learned index
inferred← citeshttps://doi.org/10.1145/3568027openalex-snapshot
Efficient Sorting, Duplicate Removal, Grouping, and Aggregation
inferred← citeshttps://doi.org/10.1145/3570956openalex-snapshot
Robust and Efficient Sorting with Offset-value Coding
inferred← citeshttps://doi.org/10.1145/3589285openalex-snapshot
InfiniFilter: Expanding Filters to Infinity and Beyond
inferred← citeshttps://doi.org/10.1145/3620665.3640402openalex-snapshot
METAL: Caching Multi-level Indexes in Domain-Specific Architectures
inferred← citeshttps://doi.org/10.1145/3626183.3660262openalex-snapshot
Brief Announcement: ROMe: Wait-free Objects for RDMA
inferred← citeshttps://doi.org/10.1145/3639296openalex-snapshot
SWIX: A Memory-efficient Sliding Window Learned Index
inferred← citeshttps://doi.org/10.1145/3639302openalex-snapshot
Limousine: Blending Learned and Classical Indexes to Self-Design Larger-than-Memory Cloud Storage Engines
inferred← citeshttps://doi.org/10.1145/3654948openalex-snapshot
Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction
inferred← citeshttps://doi.org/10.1145/3654972openalex-snapshot
Revisiting B-tree Compression: An Experimental Study
inferred← citeshttps://doi.org/10.1145/3695794.3695805openalex-snapshot
ZipCache: A DRAM/SSD Cache with Built-in Transparent Compression
inferred← citeshttps://doi.org/10.1145/3698829openalex-snapshot
Understanding and Reusing Test Suites Across Database Systems
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/3709664openalex-snapshot
B-Trees Are Back: Engineering Fast and Pageable Node Layouts
inferred← citeshttps://doi.org/10.1145/3769819openalex-snapshot
RABIT: Efficient Range Queries with Bitmap Indexing
inferred← citeshttps://doi.org/10.1145/3802030openalex-snapshot
Concurrent Path-Copying Update to Tree Structures
inferred← citeshttps://doi.org/10.1145/3803291.3803321openalex-snapshot
Adaptive Indexing for Schema-Less Temporal Databases Using Hierarchical Similarity Measurement
inferred← citeshttps://doi.org/10.1145/3829641.3829681openalex-snapshot
Design and Implementation of a College Student Time Use Research Platform Based on Front-End and Back-End Separation Architecture
inferred← citeshttps://doi.org/10.1155/ahci/9624791openalex-snapshot
Adjusting B‐Tree for Better Usability: Nodes as Files Instead of Disk Blocks
inferred← citeshttps://doi.org/10.14293/pr2199.003280.v1openalex-snapshot
Cache-Friendly Van Emde Boas Trees: Trading Space for Cache Performance
inferred← citeshttps://doi.org/10.14778/2180912.2180917openalex-snapshot
Definition, detection, and recovery of single-page failures, a fourth class of database failures
inferred← citeshttps://doi.org/10.14778/2180912.2180918openalex-snapshot
Concurrency control for adaptive indexing
inferred← citeshttps://doi.org/10.14778/2735461.2735465openalex-snapshot
In-memory performance for big data
inferred← citeshttps://doi.org/10.14778/3303753.3303759openalex-snapshot
Efficient data ingestion and query processing for LSM-based storage systems
inferred← citeshttps://doi.org/10.14778/3364324.3364334openalex-snapshot
On supporting efficient snapshot isolation for hybrid workloads with multi-versioned indexes
inferred← citeshttps://doi.org/10.14778/3447689.3447708openalex-snapshot
Teseo and the analysis of structural dynamic graphs
inferred← citeshttps://doi.org/10.14778/3681954.3682012openalex-snapshot
Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index
inferred← citeshttps://doi.org/10.14778/3685800.3685915openalex-snapshot
LeanStore: A High-Performance Storage Engine for NVMe SSDs
inferred← citeshttps://doi.org/10.14778/3705829.3705854openalex-snapshot
CUBIT: Concurrent Updatable Bitmap Indexing
inferred← citeshttps://doi.org/10.14778/3836663.3836713openalex-snapshot
Storing and Indexing Multiple Tables by Interesting Orderings: For Efficient Joins, Groupings, and Updates in Relational Databases
inferred← citeshttps://doi.org/10.15407/emodel.48.01.099openalex-snapshot
Prospects for Managing Database Record Versions
inferred← citeshttps://doi.org/10.21203/rs.3.rs-10483663/v1openalex-snapshot
MinID-X: a crystallographic database architecture for offline mineral identification on Android Devices
inferred← citeshttps://doi.org/10.2200/s00912ed2v01y201904dtm059openalex-snapshot
On Transactional Concurrency Control
inferred← citeshttps://doi.org/10.2514/1.g006688openalex-snapshot
Review of the k-Vector and Its Relation to Classical Data Structures
inferred← citeshttps://doi.org/10.36244/icj.2022.4.5openalex-snapshot
Saving Bit-flips through Smart Overwrites in NVRAM
inferred← citeshttps://doi.org/10.36676/urr.v12.i4.1649openalex-snapshot
Transaction-Level Parallelism for High-Throughput Databases Using Versioned Conflict-Free Data Structures
inferred← citeshttps://doi.org/10.4018/979-8-3373-6801-6.ch002openalex-snapshot
Database Optimization Techniques for Efficient BI Queries
inferred← citeshttps://doi.org/10.70675/3b338c57z7c98z44f2z90b6ze341126453fcopenalex-snapshot
Optimizing similarity queries in metric spaces meeting user's expectation
inferred← citeshttps://doi.org/10.70675/f4ca422bz6b0bz4321z94c1z1bcb548120f6openalex-snapshot
Gestion et optimisation des données massives issues du Web
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.