DBScholar

Back to papers

Latch-Free Data Structures for DBMS: Design, Implementation, and Evaluation

Summary: Latch-free data structures for DBMS to scale on many-core CPUs; LF hash tables adapted to PostgreSQL deliver up to 2.5× throughput on 80-core machines. Design, implementation, and evaluation show practical DBMS gains with no need for deep system-specific tuning. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4715
Venue
SIGMOD
Year
2013
Pagerank
6.9305199e-05
Overall Rank
4,064 | 72.12%
DOI
10.1145/2463676.2463720

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{horikawa_sigmod13,
        title = {{Latch-Free Data Structures for DBMS: Design, Implementation, and Evaluation}},
        author = {Horikawa, Takashi},
        series = {{SIGMOD} '13},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2463676.2463720},
        url = {https://dl.acm.org/doi/10.1145/2463676.2463720},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers