Blink-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases

Summary: Blink-hash: hybrid index enhancing B+-trees with large hash leaf nodes to randomize monotonically increasing timestamp inserts and remove hot-spot contention in in-memory time-series workloads. With median-approximation, lazy-split, and dynamic reconversion to B+-tree leaves for scans, it attains up to 91.3× higher ingestion throughput than conventional indexes while maintaining comparable scan performance. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 12991
Venue: VLDB
Year: 2023
Pagerank: 4.1905499e-05
Overall Rank: 11,231 | 21.95%
DOI: 10.14778/3583140.3583143

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
5,060	The Art of Latency Hiding in Modern Database Engines	2024	VLDB	5.7175345e-05
7,152	Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index	2024	VLDB	4.8126591e-05

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
104	Making B+-Trees Cache Conscious in Main Memory	2000	SIGMOD	0.00049475932
240	Cache Conscious Indexing for Decision-Support in Main Memory	1999	VLDB	0.00031526134
274	Approximate Medians and other Quantiles in One Pass and with Limited Memory	1998	SIGMOD	0.00029383266
643	FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory	2016	SIGMOD	0.00018733394
1,085	HOT: A Height Optimized Trie Index for Main-Memory Database Systems	2018	SIGMOD	0.00014173956
1,169	SuRF: Practical Range Query Filtering with Fast Succinct Tries	2018	SIGMOD	0.00013530267
1,300	Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes	2016	SIGMOD	0.00012711153
1,573	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	0.00011293832
2,233	Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems	2001	VLDB	9.2299873e-05
2,313	Building a Bw-Tree Takes More Than Just Buzz Words	2018	SIGMOD	9.0546844e-05
4,240	Db2 Event Store: A Purpose-Built IoT Database Engine	2020	VLDB	6.3258697e-05
6,314	HydraList: A Scalable In-Memory Index Using Asynchronous Updates and Partial Replication	2020	VLDB	5.1108651e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
8,215	Pea Hash: A Performant Extendible Adaptive Hashing Index	2023	SIGMOD	4.5522624e-05
10,565	Efficient Concurrent Updates to Persistent Randomized Binary Search Trees	2025	VLDB	4.1905499e-05
7,990	BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees	2023	VLDB	4.6086117e-05
4,131	B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives	2012	VLDB	6.4203081e-05
1,909	BF-Tree: Approximate Tree Indexing	2014	VLDB	0.00010123661
6,789	Index-Accelerated Pattern Matching in Event Stores	2021	SIGMOD	4.9206048e-05
6,708	Just-In-Time Data Structures	2015	CIDR	4.948865e-05
1,766	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB	0.00010611043
3,760	A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms	2016	SIGMOD	6.7790524e-05
8,653	Adaptive Hybrid Indexes	2022	SIGMOD	4.4696663e-05