The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
Abstract
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vector units. There has been much work to exploit modern processor architectures for database primitives like scan, sort, join and aggregation. However, unlike other primitives, tree search presents significant challenges due to irregular and unpredictable data accesses in tree traversal.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Comer, D. (1979) · ACM Computing Surveys · doi:10.1145/356770.356776 · Cited by 1,859
Larrabee: a many-core x86 architecture for visual computing
Seiler, L., Carmean, D., Sprangle, E., Forsyth, T., Abrash, M., Dubey, P., Junkins, S., Lake, A., Sugerman, J., Cavin, R., et al. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360617 · Cited by 771
Self-citationSuper-Scalar RAM-CPU Cache Compression
Zukowski, M., Heman, S., Nes, N., & Boncz, P. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.150 · Cited by 476
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
Sort vs. Hash revisited: fast join implementation on modern multi-core CPUs
Kim, C., Kaldewey, T., Lee, V. W., Sedlar, E., Nguyen, A. D., Satish, N., Chhugani, J., Di Blas, A., & Dubey, P. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687553.1687564 · Cited by 280
Self-citationA 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
Implementing database operations using SIMD instructions
Zhou, J., & Ross, K. A. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564709 · Cited by 242
Efficient implementation of sorting on multi-core SIMD CPU architecture
Chhugani, J., Nguyen, A. D., Lee, V. W., Macy, W., Hagog, M., Chen, Y.-K., Baransi, A., Kumar, S., & Dubey, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454171 · Cited by 232
Self-citationWillhalm, T., Popovici, N., Boshmaf, Y., et al. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687671 · Cited by 205
Compressing relations and indexes
Goldstein, J., Ramakrishnan, R., & Shaft, U. (2002) · Proceedings 14th International Conference on Data Engineering · doi:10.1109/icde.1998.655800 · Cited by 203
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
Real-time parallel hashing on the GPU
Alcantara, D. A., Sharf, A., Abbasinejad, F., Sengupta, S., Mitzenmacher, M., Owens, J. D., & Amenta, N. (2009) · ACM Transactions on Graphics · doi:10.1145/1618452.1618500 · Cited by 181
Seiler, L., Carmean, D., Sprangle, E., Forsyth, T., Abrash, M., Dubey, P. K., Junkins, S., Lake, A., Sugerman, J., Cavin, R., et al. (2008) · ACM SIGGRAPH Conference Papers (SIGGRAPH) · doi:10.1145/1399504.1360617 · Cited by 129
Self-citationGraefe, G., & Larson, P.-A. (2002) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2001.914847 · Cited by 100
Parallel search on video cards
Kaldewey, T., Hagen, J., Blas, A. D., & Sedlar, E. (2009) · Cited by 32
Self-citation
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
Debunking the 100X GPU vs. CPU myth: an evaluation of throughput computing on CPU and GPU
Lee, V. W., Kim, C., Chhugani, J., Deisher, M., Kim, D., Nguyen, A. D., Satish, N., Smelyanskiy, M., Chennupaty, S., Hammarlund, P., et al. (2010) · Proceedings of the 37th annual international symposium on Computer architecture · doi:10.1145/1815961.1816021 · Cited by 640
Self-citationThe adaptive radix tree: ARTful indexing for main-memory databases
Leis, V., Kemper, A., & Neumann, T. (2013) · 2013 IEEE 29th International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544812 · Cited by 420
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
Debunking the 100X GPU vs. CPU myth: an evaluation of throughput computing on CPU and GPU
Lee, V. W., Kim, C., Chhugani, J., Deisher, M., Kim, D., Nguyen, A. D., Satish, N., Smelyanskiy, M., Chennupaty, S., Hammarlund, P., et al. (2010) · ACM SIGARCH Computer Architecture News · doi:10.1145/1816038.1816021 · Cited by 267
Self-citation
Metadata
- Authors
- Kim, C., Chhugani, J., Satish, N., Sedlar, E., Nguyen, A. D., Kaldewey, T., Lee, V. W., Brandt, S. A., & Dubey, P.
- Venue
- Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
- Publisher
- ACM
- Published
- 2010-06-06
- Pages
- 339-350
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2151224499
- Cited by
- 306
- References
- 16
- FWCI
- 22.55
- 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.