Efficiently Searching In-Memory Sorted Arrays
Authors:
Open Access
- 25 June 2019
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 36-53
Abstract
No abstract availableKeywords
Funding Information
- Gift donation by Huawei
- Gift donation by Google
- This work was supported in part by CRISP one of six centers in JUMP a Semiconductor Research Corporation (SRC) program sponsor
This publication has 23 references indexed in Scilit:
- Power-Law Distributions in Empirical DataSIAM Review, 2009
- Breaking the memory wall in MonetDBCommunications of the ACM, 2008
- POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIAInternational Journal of Computational Geometry & Applications, 2006
- On QCD string theory and AdS dynamicsJournal of High Energy Physics, 1999
- Improved histograms for selectivity estimation of range predicatesACM SIGMOD Record, 1996
- Hitting the memory wallACM SIGARCH Computer Architecture News, 1995
- Three-point iterations derived from exponential curve fittingIEEE Transactions on Circuits and Systems, 1979
- Interpolation search—a log log N searchCommunications of the ACM, 1978
- The interpolation-sequential search algorithmInformation Processing Letters, 1977
- Table Lookup TechniquesACM Computing Surveys, 1971