The Case for Learned Index Structures
Top Cited Papers
- 27 May 2018
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 489-504
- https://doi.org/10.1145/3183713.3196909
Abstract
No abstract availableKeywords
Funding Information
- Defense Advanced Research Projects Agency (16-43-D3M-FP-040)
- Air Force Office of Scientific Research (FA9550-15-1-0144)
- National Science Foundation (IIS-1453171)
This publication has 38 references indexed in Scilit:
- An introduction to ROC analysisPattern Recognition Letters, 2005
- Cuckoo hashingJournal of Algorithms, 2004
- Network Applications of Bloom Filters: A SurveyInternet Mathematics, 2004
- Making B+- trees cache conscious in main memoryACM SIGMOD Record, 2000
- Efficient rebalancing of chromatic search treesJournal of Computer and System Sciences, 1994
- Dynamic Perfect Hashing: Upper and Lower BoundsSIAM Journal on Computing, 1994
- The design of POSTGRESACM SIGMOD Record, 1986
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972
- Trie memoryCommunications of the ACM, 1960
- Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial EstimatorThe Annals of Mathematical Statistics, 1956