The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
The adaptive radix tree: ARTful indexing for main-memory databases
Abstract
Main memory capacities have grown up to a point where most databases fit into RAM. For main-memory database systems, index structure performance is a critical bottleneck. Traditional in-memory data structures like balanced binary search trees are not efficient on modern hardware, because they do not optimally utilize on-CPU caches. Hash tables, also often used for main-memory indexes, are fast but only support point queries. To overcome these shortcomings, we present ART, an adaptive radix tree (trie) for efficient indexing in main memory. Its lookup performance surpasses highly tuned, read-only search trees, while supporting very efficient insertions and deletions as well. At the same time, ART is very space efficient and solves the problem of excessive worst-case space consumption, which plagues most radix trees, by adaptively choosing compact and efficient data structures for internal nodes. Even though ART's performance is comparable to hash tables, it maintains the data in sorted order, which enables additional operations like range scan and prefix lookup.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Comer, D. (1979) · ACM Computing Surveys · doi:10.1145/356770.356776 · Cited by 1,859
Knuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Knuth, D. E. (1998) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,421
Fredkin, E. (1960) · Communications of the ACM · doi:10.1145/367390.367400 · Cited by 1,090
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Morrison, D. R. (1968) · Journal of the ACM · doi:10.1145/321479.321481 · Cited by 969
A dichromatic framework for balanced trees
Guibas, L. J., & Sedgewick, R. (1978) · 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) · doi:10.1109/sfcs.1978.3 · Cited by 661
HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots
Kemper, A., & Neumann, T. (2011) · 2011 IEEE 27th International Conference on Data Engineering · doi:10.1109/icde.2011.5767867 · Cited by 589
Self-citationH-store: a high-performance, distributed main memory transaction processing system
Kallman, R., Kimura, H., Natkins, J., Pavlo, A., Rasin, A., Zdonik, S., Jones, E. P. C., Madden, S., Stonebraker, M., Zhang, Y., et al. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454211 · Cited by 520
Symmetric binary B-Trees: Data structure and maintenance algorithms
Bayer, R. (1972) · Acta Informatica · doi:10.1007/bf00289509 · Cited by 495
SAP HANA database: data management for modern business applications
Färber, F., Cha, S. K., Primsch, J., Bornhövd, C., Sigg, S., & Lehner, W. (2012) · ACM SIGMOD Record · doi:10.1145/2094114.2094126 · Cited by 396
Making B+- trees cache conscious in main memory
Rao, J., & Ross, K. A. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335449 · Cited by 373
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
Kim, C., Chhugani, J., Satish, N., Sedlar, E., Nguyen, A. D., Kaldewey, T., Lee, V. W., Brandt, S. A., & Dubey, P. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807206 · Cited by 306
A Study of Index Structures for Main Memory Database Management Systems
Lehman, T. J., & Carey, M. J. (1986) · Minds at UW (University of Wisconsin) · Cited by 267
Cache Conscious Indexing for Decision-Support in Main Memory
Rao, J., & Ross, K. A. (1998) · doi:10.7916/d8t441zb · Cited by 248
Organization and maintenance of large ordered indices
Bayer, R., & McCreight, E. (1970) · Proceedings of the 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control - SIGFIDET '70 · doi:10.1145/1734663.1734671 · Cited by 209
Making B+- trees cache conscious in main memory
Rao, J., & Ross, K. A. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335449 · Cited by 187
Fast updates on read-optimized databases using multi-core CPUs
Krueger, J., Kim, C., Grund, M., Satish, N., Schwalb, D., Chhugani, J., Plattner, H., Dubey, P. K., & Zeier, A. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/2047485.2047491 · Cited by 133
Graefe, G., & Larson, P.-A. (2002) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2001.914847 · Cited by 100
Efficient In-Memory Indexing with Generalized Prefix Trees.
Böhm, M., Schlegel, B., Volk, P. B., Fischer, U., Habich, D., & Lehner, W. (2011) · BTW · Cited by 39
Kissinger, T., Schlegel, B., Habich, D., & Lehner, W. (2012) · International Workshop on Data Management on New Hardware (DaMoN) · doi:10.1145/2236584.2236587 · Cited by 39
Yamamuro, T., Onizuka, M., Hitaka, T., et al. (2012) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/2247596.2247643 · Cited by 12
Cited by
The Case for Learned Index Structures
Kraska, T., Beutel, A., Chi, E. H., Dean, J., & Polyzotis, N. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3196909 · Cited by 956
In-Memory Big Data Management and Processing: A Survey
Zhang, H., Chen, G., Ooi, B. C., Tan, K.-L., & Zhang, M. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2427795 · Cited by 414
Metadata
- Authors
- Leis, V., Kemper, A., & Neumann, T.
- Venue
- 2013 IEEE 29th International Conference on Data Engineering (ICDE)
- Publisher
- IEEE
- Published
- 2013-04
- Pages
- 38-49
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2030062409
- Cited by
- 420
- References
- 22
- FWCI
- 15.13
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.