- Google Spanner
- F1: A Distributed SQL Database That Scales
- TiDB: A Raft-based HTAP Database
- HTAP Survey
- veDB-HTAP: a Highly Integrated, Efficient and Adaptive HTAP System
- LSM tree
- Btree. Bayer. 1970.
- Ubiquitous btree. 1979.
- Btree evolution 2001.
- Modern btree techniques 2011.
- More modern btree techniques 2024.
- Query Optimization Overview
- How Good are Query Optimizers, Really?
- The Volcano Optimizer Generator: Extensibility and Efficient Search
- Machine Learning-based Cardinality Estimation in DBMS on Pre-Aggregated Data
- The Cascades Framework for Query Optimization
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node
- Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs
- Multidimensional Binary Search Trees Used for Associative Searching
- Approximate nearest neighbor algorithm based on navigable small world graphs
- Product quantization for nearest neighbor search
- Performance of Nearest Neighbor Queries in R-trees
- Tensor-Train Point Cloud Compression and Efficient Approximate Nearest-Neighbor Search
Awesome Concurrency by Roman Lipovsky.