Implementing database operations using SIMD instructions
- 3 June 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 145-156
- https://doi.org/10.1145/564691.564709
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Conjunctive selection conditions in main memoryPublished by Association for Computing Machinery (ACM) ,2002
- Improving index performance through prefetchingPublished by Association for Computing Machinery (ACM) ,2001
- Optimizing multidimensional index trees for main memory accessPublished by Association for Computing Machinery (ACM) ,2001
- Making B+- trees cache conscious in main memoryPublished by Association for Computing Machinery (ACM) ,2000
- A Reliable Randomized Algorithm for the Closest-Pair ProblemJournal of Algorithms, 1997
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- The K-D-B-treePublished by Association for Computing Machinery (ACM) ,1981
- Search within a PageJournal of the ACM, 1979
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974