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: 12990
Venue: VLDB
Year: 2023
Pagerank: 4.1945683e-05
Overall Rank: 11,229 | 21.89%
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,312	The Art of Latency Hiding in Modern Database Engines	2024	VLDB	5.5734224e-05
7,154	Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index	2024	VLDB	4.815267e-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
103	Making B+-Trees Cache Conscious in Main Memory	2000	SIGMOD	0.00049150032
238	Cache Conscious Indexing for Decision-Support in Main Memory	1999	VLDB	0.00031642425
275	Approximate Medians and other Quantiles in One Pass and with Limited Memory	1998	SIGMOD	0.00029364901
680	FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory	2016	SIGMOD	0.0001821501
1,087	HOT: A Height Optimized Trie Index for Main-Memory Database Systems	2018	SIGMOD	0.00014162909
1,169	SuRF: Practical Range Query Filtering with Fast Succinct Tries	2018	SIGMOD	0.00013536447
1,312	Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes	2016	SIGMOD	0.00012652548
1,573	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	0.00011295081
2,244	Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems	2001	VLDB	9.2097912e-05
2,394	Building a Bw-Tree Takes More Than Just Buzz Words	2018	SIGMOD	8.9001843e-05
4,242	Db2 Event Store: A Purpose-Built IoT Database Engine	2020	VLDB	6.3315241e-05
6,316	HydraList: A Scalable In-Memory Index Using Asynchronous Updates and Partial Replication	2020	VLDB	5.1141977e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
8,219	Pea Hash: A Performant Extendible Adaptive Hashing Index	2023	SIGMOD	4.5565914e-05
10,556	Efficient Concurrent Updates to Persistent Randomized Binary Search Trees	2025	VLDB	4.1945683e-05
7,995	BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees	2023	VLDB	4.6109825e-05
4,130	B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives	2012	VLDB	6.4256779e-05
1,913	BF-Tree: Approximate Tree Indexing	2014	VLDB	0.00010113937
6,788	Index-Accelerated Pattern Matching in Event Stores	2021	SIGMOD	4.9252064e-05
6,708	Just-In-Time Data Structures	2015	CIDR	4.953106e-05
1,774	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB	0.00010604097
3,777	A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms	2016	SIGMOD	6.7750901e-05
8,655	Adaptive Hybrid Indexes	2022	SIGMOD	4.4739554e-05