DBScholar

Back to papers

Interleaved Multi-Vectorizing

Summary: Interleaved multi-vectorizing (IMV) hides SIMD cache-miss latency by interleaving multiple vectorized execution instances and using prefetching. Residual vectorized states address control-flow divergence, accelerating pointer-chasing and full query pipelines by up to 3.17× over SIMD. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12302
Venue
VLDB
Year
2020
Pagerank
5.4599422e-05
Overall Rank
8,238 | 43.49%
DOI
10.14778/3368289.3368290

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{fang_vldb20,
        title = {{Interleaved Multi-Vectorizing}},
        author = {Fang, Zhuhe and Zheng, Beilei and Weng, Chuliang},
        journal = {PVLDB},
        series = {{VLDB} '20},
        volume = {13},
        number = {3},
        pages = {226--238},
        doi = {10.14778/3368289.3368290},
        url = {https://doi.org/10.14778/3368289.3368290},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
271 TiDB: A Raft-based HTAP Database 2020 VLDB 0.00022703024
3,644 CoroBase: Coroutine-Oriented Main-Memory Database Engine 2021 VLDB 7.2306862e-05
4,440 The Art of Latency Hiding in Modern Database Engines 2024 VLDB 6.7049797e-05
5,765 Charting the Design Space of Query Execution using VOILA 2021 VLDB 6.0953705e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

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

Rank Cited Paper Year Venue Pagerank
14 MonetDB/X100: Hyper-Pipelining Query Execution 2005 CIDR 0.0006312782
23 Efficiently Compiling Efficient Query Plans for Modern Hardware 2011 VLDB 0.00054886415
29 Database Architecture Optimized for the New Bottleneck: Memory Access 1999 VLDB 0.00052093615
241 Morsel-Driven Parallelism: A NUMA-Aware Query Evaluation Framework for the Many-Core Age 2014 SIGMOD 0.00023654664
278 FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs 2010 SIGMOD 0.00022476841
293 Implementing Database Operations Using SIMD Instructions 2002 SIGMOD 0.00022259273
634 Rethinking SIMD Vectorization for In-Memory Databases 2015 SIGMOD 0.00015533814
649 Everything You Always Wanted to Know About Compiled and Vectorized Queries But Were Afraid to Ask 2018 VLDB 0.00015320656
712 Efficient Implementation of Sorting on Multi-Core SIMD CPU Architecture 2008 VLDB 0.0001468812
1,379 Relaxed Operator Fusion for In-Memory Databases: Making Compilation, Vectorization, and Prefetching Work Together At Last 2018 VLDB 0.00010970894
2,649 Asynchronous Memory Access Chaining 2016 VLDB 8.2926258e-05
2,767 Exploiting Coroutines to Attack the "Killer Nanoseconds" 2018 VLDB 8.1507611e-05
2,890 Interleaving with Coroutines: A Practical Approach for Robust Index Joins 2018 VLDB 7.9880033e-05
3,212 Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions 2015 VLDB 7.6328776e-05
3,435 Improving Main Memory Hash Joins on Intel Xeon Phi Processors: An Experimental Approach 2015 VLDB 7.4172582e-05
4,177 SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures 2015 VLDB 6.8499317e-05
Previous Page 1 / 1 Next

Semantically Similar Papers