BUZZARD: A NUMA-Aware In-Memory Indexing System
Summary: BUZZARD: NUMA-aware in-memory indexing using a prefix-tree partitioned across nodes, routing requests to local workers to minimize remote traffic. Adaptive partitioning with batch flushes and owner-local indexing reduces contention, boosting throughput on NUMA (220%) vs a single index. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lukas M. Maas (Technical University of Dresden)
- 2. Thomas Kissinger (Technical University of Dresden)
- 3. Dirk Habich (Technical University of Dresden)
- 4. Wolfgang Lehner (Technical University of Dresden)
BibTeX Citation
@inproceedings{maas_sigmod13,
title = {{BUZZARD: A NUMA-Aware In-Memory Indexing System}},
author = {Maas, Lukas M. and Kissinger, Thomas and Habich, Dirk and Lehner, Wolfgang},
series = {{SIGMOD} '13},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2463676.2465342},
url = {https://dl.acm.org/doi/10.1145/2463676.2465342},
year = {2013}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,479 | P-MOSS: Scheduling Main-Memory Indexes Over NUMA Servers Using Next Token Prediction | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,625 | QPPT: Query Processing on Prefix Trees | 2013 | CIDR | 5.3979222e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,378 | A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms | 2016 | SIGMOD |
| 2 | 10,605 | SHARD: A Scalable and Resize-optimized Hash Index on Disaggregated Memory | 2026 | VLDB |
| 3 | 2,267 | In-Memory Performance for Big Data | 2015 | VLDB |
| 4 | 7,827 | Efficient B-tree Based Indexing for Cloud Data Processing | 2010 | VLDB |
| 5 | 2,212 | Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory | 2022 | SIGMOD |
| 6 | 1,110 | Buffering Accesses to Memory-Resident Index Structures | 2003 | VLDB |
| 7 | 1,342 | Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks | 2019 | SIGMOD |
| 8 | 5,823 | HydraList: A Scalable In-Memory Index Using Asynchronous Updates and Partial Replication | 2020 | VLDB |
| 9 | 7,492 | Scalable Distributed Inverted List Indexes in Disaggregated Memory | 2024 | SIGMOD |
| 10 | 948 | BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory | 2018 | VLDB |