An Eight-Dimensional Systematic Evaluation of Optimized Search Algorithms on Modern Processors

Summary: Evaluates hardware-aware search algorithms (sequential, binary, k-ary) across an eight-dimensional optimization space on modern CPUs. Finds no universal winner; offers hardware- and size-driven guidance on variants to deploy for efficient index/search. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h6e05961bbe147362
Venue: VLDB
Year: 2018
Pagerank: 5.7861149e-05
Overall Rank: 6,434 | 56.75%
DOI: 10.14778/3236187.3236205

Incoming Non-self Citations Over Time

Authors

1. Lars-Christian Schulz (University of Magdeburg)
2. David Broneske (University of Magdeburg)
3. Gunter Saake (University of Magdeburg)

BibTeX Citation

@article{schulz_vldb18,
        title = {{An Eight-Dimensional Systematic Evaluation of Optimized Search Algorithms on Modern Processors}},
        author = {Schulz, Lars-Christian and Broneske, David and Saake, Gunter},
        journal = {PVLDB},
        series = {{VLDB} '18},
        volume = {11},
        number = {11},
        pages = {1550--1562},
        doi = {10.14778/3236187.3236205},
        url = {https://doi.org/10.14778/3236187.3236205},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
848	Benchmarking Learned Indexes	2021	VLDB	0.00013506188
8,873	Why Are Learned Indexes So Effective but Sometimes Ineffective?	2025	VLDB	5.2582842e-05

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
40	The Case for Learned Index Structures	2018	SIGMOD	0.00046284649
69	Making B+-Trees Cache Conscious in Main Memory	2000	SIGMOD	0.00037950385
287	Implementing Database Operations Using SIMD Instructions	2002	SIGMOD	0.00021970198

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,368	List Intersection for Web Search: Algorithms, Cost Models, and Optimizations	2019	VLDB
2	7,394	Efficient and Generic Evaluation of Ranked Queries	2011	SIGMOD
3	1,671	Efficient Parallel Lists Intersection and Index Compression Algorithms using Graphics Processing Units	2011	VLDB
4	4,163	Distributing a Search Tree Among a Growing Number of Processors	1994	SIGMOD
5	9,786	Memory-Efficient Search Trees for Database Management Systems	2021	SIGMOD
6	192	Algorithmics and Applications of Tree and Graph Searching	2002	PODS
7	282	FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs	2010	SIGMOD
8	7,355	Efficient Search in Very Large Databases	1988	VLDB
9	1,769	Improving the Performance of List Intersection	2009	VLDB
10	13,377	Fast Search In Main Memory Databases	1992	SIGMOD