{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T08:53:09Z","timestamp":1793436789348,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":75,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["16-43-D3M-FP-040"],"award-info":[{"award-number":["16-43-D3M-FP-040"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-15-1-0144"],"award-info":[{"award-number":["FA9550-15-1-0144"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1453171"],"award-info":[{"award-number":["IIS-1453171"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3183713.3196909","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T08:39:28Z","timestamp":1527237568000},"page":"489-504","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":721,"title":["The Case for Learned Index Structures"],"prefix":"10.1145","author":[{"given":"Tim","family":"Kraska","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex","family":"Beutel","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ed H.","family":"Chi","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey","family":"Dean","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neoklis","family":"Polyzotis","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Database architects blog: The case for b-tree index structures. http:\/\/databasearchitects.blogspot.de\/2017\/12\/ the-case-for-b-tree-index-structures.html.  Database architects blog: The case for b-tree index structures. http:\/\/databasearchitects.blogspot.de\/2017\/12\/ the-case-for-b-tree-index-structures.html."},{"key":"e_1_3_2_1_2_1","unstructured":"Google's sparsehash documentation. https:\/\/github.com\/sparsehash\/ sparsehash\/blob\/master\/src\/sparsehash\/sparse_hash_map.  Google's sparsehash documentation. https:\/\/github.com\/sparsehash\/ sparsehash\/blob\/master\/src\/sparsehash\/sparse_hash_map."},{"key":"e_1_3_2_1_3_1","unstructured":"An in-depth look at google's first tensor processing unit (tpu). https:\/\/cloud.google.com\/blog\/big-data\/2017\/05\/ an-in-depth-look-at-googles-first-tensor-processing-unit-tpu.  An in-depth look at google's first tensor processing unit (tpu). https:\/\/cloud.google.com\/blog\/big-data\/2017\/05\/ an-in-depth-look-at-googles-first-tensor-processing-unit-tpu."},{"key":"e_1_3_2_1_4_1","unstructured":"Intel Xeon Phi. https:\/\/www.intel.com\/content\/www\/us\/en\/products\/ processors\/xeon-phi\/xeon-phi-processors.html.  Intel Xeon Phi. https:\/\/www.intel.com\/content\/www\/us\/en\/products\/ processors\/xeon-phi\/xeon-phi-processors.html."},{"key":"e_1_3_2_1_5_1","unstructured":"Moore Law is Dead but GPU will get 1000X faster by 2025. https:\/\/www.nextbigfuture.com\/2017\/06\/ moore-law-is-dead-but-gpu-will-get-1000x-faster-by-2025.html.  Moore Law is Dead but GPU will get 1000X faster by 2025. https:\/\/www.nextbigfuture.com\/2017\/06\/ moore-law-is-dead-but-gpu-will-get-1000x-faster-by-2025.html."},{"key":"e_1_3_2_1_6_1","unstructured":"NVIDIA NVLink High-Speed Interconnect. http:\/\/www.nvidia.com\/object\/ nvlink.html.  NVIDIA NVLink High-Speed Interconnect. http:\/\/www.nvidia.com\/object\/ nvlink.html."},{"key":"e_1_3_2_1_7_1","unstructured":"Stanford DAWN cuckoo hashing. https:\/\/github.com\/stanford-futuredata\/ index-baselines.  Stanford DAWN cuckoo hashing. https:\/\/github.com\/stanford-futuredata\/ index-baselines."},{"key":"e_1_3_2_1_8_1","unstructured":"Trying to speed up binary search. http:\/\/databasearchitects.blogspot.com\/ 2015\/09\/trying-to-speed-up-binary-search.html.  Trying to speed up binary search. http:\/\/databasearchitects.blogspot.com\/ 2015\/09\/trying-to-speed-up-binary-search.html."},{"key":"e_1_3_2_1_9_1","first-page":"265","volume-title":"OSDI","volume":"16","author":"Abadi M.","year":"2016","unstructured":"M. Abadi , P. Barham , J. Chen , Z. Chen , A. Davis , J. Dean , M. Devin , S. Ghemawat , G. Irving , M. Isard , : A system for large-scale machine learning . In OSDI , volume 16 , pages 265 -- 283 , 2016 . M. Abadi, P. Barham, J. Chen, Z. Chen, A. Davis, J. Dean, M. Devin, S. Ghemawat, G. Irving, M. Isard, et al. Tensorflow: A system for large-scale machine learning. In OSDI, volume 16, pages 265--283, 2016."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1299015.1299021"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556556"},{"key":"e_1_3_2_1_12_1","volume-title":"CIDR","author":"Armbrust M.","year":"2009","unstructured":"M. Armbrust , A. Fox , D. A. Patterson , N. Lanham , B. Trushkowsky , J. Trutna , and H. Oh . SCADS: scale-independent storage for social computing applications . In CIDR , 2009 . M. Armbrust, A. Fox, D. A. Patterson, N. Lanham, B. Trushkowsky, J. Trutna, and H. Oh. SCADS: scale-independent storage for social computing applications. In CIDR, 2009."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733094"},{"key":"e_1_3_2_1_14_1","unstructured":"Performance comparison: linear search vs binary search. https:\/\/dirtyhandscoding.wordpress.com\/2017\/08\/25\/ performance-comparison-linear-search-vs-binary-search\/.  Performance comparison: linear search vs binary search. https:\/\/dirtyhandscoding.wordpress.com\/2017\/08\/25\/ performance-comparison-linear-search-vs-binary-search\/."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77465-5_19"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289509"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1734663.1734671"},{"key":"e_1_3_2_1_18_1","volume-title":"Discriminative learning under covariate shift. Journal of Machine Learning Research, 10(Sep):2137--2155","author":"Bickel S.","year":"2009","unstructured":"S. Bickel , M. Br\u00fcckner , and T. Scheffer . Discriminative learning under covariate shift. Journal of Machine Learning Research, 10(Sep):2137--2155 , 2009 . S. Bickel, M. Br\u00fcckner, and T. Scheffer. Discriminative learning under covariate shift. Journal of Machine Learning Research, 10(Sep):2137--2155, 2009."},{"key":"e_1_3_2_1_19_1","first-page":"227","volume-title":"BTW","author":"B\u00f6hm M.","year":"2011","unstructured":"M. B\u00f6hm , B. Schlegel , P. B. Volk , U. Fischer , D. Habich , and W. Lehner . Efficient in-memory indexing with generalized prefix trees . In BTW , pages 227 -- 246 , 2011 . M. B\u00f6hm, B. Schlegel, P. B. Volk, U. Fischer, D. Habich, and W. Lehner. Efficient in-memory indexing with generalized prefix trees. In BTW, pages 227--246, 2011."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80075-3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376645"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_2_1_23_1","first-page":"205","volume-title":"OSDI","author":"Chang F.","year":"2006","unstructured":"F. Chang , J. Dean , S. Ghemawat , W. C. Hsieh , D. A. Wallach , M. Burrows , T. Chandra , A. Fikes , and R. Gruber . Bigtable: A distributed storage system for structured data (awarded best paper!) . In OSDI , pages 205 -- 218 , 2006 . F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. Gruber. Bigtable: A distributed storage system for structured data (awarded best paper!). In OSDI, pages 205--218, 2006."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824045"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791194094"},{"key":"e_1_3_2_1_27_1","volume-title":"Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research, 12(Jul):2121--2159","author":"Duchi J.","year":"2011","unstructured":"J. Duchi , E. Hazan , and Y. Singer . Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research, 12(Jul):2121--2159 , 2011 . J. Duchi, E. Hazan, and Y. Singer. Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research, 12(Jul):2121--2159, 2011."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728174"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.10.010"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/367390.367400"},{"key":"e_1_3_2_1_32_1","volume-title":"A-tree: A bounded approximate index structure. CoRR, abs\/1801.10207","author":"Galakatos A.","year":"2018","unstructured":"A. Galakatos , M. Markovitch , C. Binnig , R. Fonseca , and T. Kraska . A-tree: A bounded approximate index structure. CoRR, abs\/1801.10207 , 2018 . A. Galakatos, M. Markovitch, C. Binnig, R. Fonseca, and T. Kraska. A-tree: A bounded approximate index structure. CoRR, abs\/1801.10207, 2018."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/645483.656226"},{"key":"e_1_3_2_1_34_1","first-page":"2672","volume-title":"NIPS","author":"Goodfellow I.","year":"2014","unstructured":"I. Goodfellow , J. Pouget-Abadie , M. Mirza , B. Xu , D. Warde-Farley , S. Ozair , A. Courville , and Y. Bengio . Generative adversarial nets . In NIPS , pages 2672 -- 2680 , 2014 . I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio. Generative adversarial nets. In NIPS, pages 2672--2680, 2014."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140402.1140409"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656370"},{"key":"e_1_3_2_1_37_1","volume-title":"arXiv preprint arXiv:1308.0850","author":"Graves A.","year":"2013","unstructured":"A. Graves . Generating sequences with recurrent neural networks. arXiv preprint arXiv:1308.0850 , 2013 . A. Graves. Generating sequences with recurrent neural networks. arXiv preprint arXiv:1308.0850, 2013."},{"key":"e_1_3_2_1_38_1","first-page":"841","volume-title":"SODA","author":"Grossi R.","year":"2003","unstructured":"R. Grossi , A. Gupta , and J. S. Vitter . High-order entropy-compressed text indexes . In SODA , pages 841 -- 850 . Society for Industrial and Applied Mathematics , 2003 . R. Grossi, A. Gupta, and J. S. Vitter. High-order entropy-compressed text indexes. In SODA, pages 841--850. Society for Industrial and Applied Mathematics, 2003."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213586"},{"key":"e_1_3_2_1_40_1","volume-title":"CNN based hashing for image retrieval. CoRR, abs\/1509.01354","author":"Guo J.","year":"2015","unstructured":"J. Guo and J. Li . CNN based hashing for image retrieval. CoRR, abs\/1509.01354 , 2015 . J. Guo and J. Li. CNN based hashing for image retrieval. CoRR, abs\/1509.01354, 2015."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.3007062"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.1953058"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"K. Kaczmarski. B + -Tree Optimized for GPGPU. 2012.  K. Kaczmarski. B + -Tree Optimized for GPGPU. 2012.","DOI":"10.1007\/978-3-642-33615-7_27"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807206"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2236584.2236587"},{"key":"e_1_3_2_1_46_1","first-page":"294","volume-title":"VLDB","author":"Lehman T. J.","year":"1986","unstructured":"T. J. Lehman and M. J. Carey . A study of index structures for main memory database management systems . In VLDB , pages 294 -- 303 , 1986 . T. J. Lehman and M. J. Carey. A study of index structures for main memory database management systems. In VLDB, pages 294--303, 1986."},{"key":"e_1_3_2_1_47_1","unstructured":"V. Leis. FAST source. http:\/\/www-db.in.tum.de\/leis\/index\/fast.cpp.  V. Leis. FAST source. http:\/\/www-db.in.tum.de\/leis\/index\/fast.cpp."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_3_2_1_49_1","first-page":"570","volume-title":"Readings in database systems","author":"Litwin W.","year":"1988","unstructured":"W. Litwin . Readings in database systems . chapter Linear Hashing: A New Tool for File and Table Addressing., pages 570 -- 581 . Morgan Kaufmann Publishers Inc ., 1988 . W. Litwin. Readings in database systems. chapter Linear Hashing: A New Tool for File and Table Addressing., pages 570--581. Morgan Kaufmann Publishers Inc., 1988."},{"key":"e_1_3_2_1_50_1","first-page":"522","volume-title":"Neural networks for density estimation","author":"Magdon-Ismail M.","year":"1999","unstructured":"M. Magdon-Ismail and A. F. Atiya . Neural networks for density estimation . In M. J. Kearns, S. A. Solla, and D. A. Cohn, editors, NIPS, pages 522 -- 528 . MIT Press , 1999 . M. Magdon-Ismail and A. F. Atiya. Neural networks for density estimation. In M. J. Kearns, S. A. Solla, and D. A. Cohn, editors, NIPS, pages 522--528. MIT Press, 1999."},{"key":"e_1_3_2_1_51_1","first-page":"571","volume-title":"NIPS","author":"Miller D. J.","year":"1996","unstructured":"D. J. Miller and H. S. Uyar . A mixture of experts classifier with learning based on both labelled and unlabelled data . In NIPS , pages 571 -- 577 , 1996 . D. J. Miller and H. S. Uyar. A mixture of experts classifier with learning based on both labelled and unlabelled data. In NIPS, pages 571--577, 1996."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384004"},{"key":"e_1_3_2_1_53_1","volume-title":"A model for learned bloom filters and related structures. arXiv preprint arXiv:1802.00884","author":"Mitzenmacher M.","year":"2018","unstructured":"M. Mitzenmacher . A model for learned bloom filters and related structures. arXiv preprint arXiv:1802.00884 , 2018 . M. Mitzenmacher. A model for learned bloom filters and related structures. arXiv preprint arXiv:1802.00884, 2018."},{"key":"e_1_3_2_1_54_1","first-page":"476","volume-title":"VLDB","author":"Moerkotte G.","year":"1998","unstructured":"G. Moerkotte . Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing . In VLDB , pages 476 -- 487 , 1998 . G. Moerkotte. Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing. In VLDB, pages 476--487, 1998."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453927"},{"key":"e_1_3_2_1_56_1","unstructured":"OpenStreetMap database \u00a9OpenStreetMap contributors. https:\/\/aws. amazon.com\/public-datasets\/osm.  OpenStreetMap database \u00a9OpenStreetMap contributors. https:\/\/aws. amazon.com\/public-datasets\/osm."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335449"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850585"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/509383.509391"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882918"},{"key":"e_1_3_2_1_62_1","volume-title":"Outrageously large neural networks: The sparsely-gated mixtureof-experts layer. arXiv preprint arXiv:1701.06538","author":"Shazeer N.","year":"2017","unstructured":"N. Shazeer , A. Mirhoseini , K. Maziarz , A. Davis , Q. Le , G. Hinton , and J. Dean . Outrageously large neural networks: The sparsely-gated mixtureof-experts layer. arXiv preprint arXiv:1701.06538 , 2017 . N. Shazeer, A. Mirhoseini, K. Maziarz, A. Davis, Q. Le, G. Hinton, and J. Dean. Outrageously large neural networks: The sparsely-gated mixtureof-experts layer. arXiv preprint arXiv:1701.06538, 2017."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/16856.16888"},{"key":"e_1_3_2_1_64_1","first-page":"3104","volume-title":"NIPS","author":"Sutskever I.","year":"2014","unstructured":"I. Sutskever , O. Vinyals , and Q. V. Le . Sequence to sequence learning with neural networks . In NIPS , pages 3104 -- 3112 , 2014 . I. Sutskever, O. Vinyals, and Q. V. Le. Sequence to sequence learning with neural networks. In NIPS, pages 3104--3112, 2014."},{"key":"e_1_3_2_1_65_1","volume-title":"Ensemble adversarial training: Attacks and defenses. arXiv preprint arXiv:1705.07204","author":"Tram\u00e8r F.","year":"2017","unstructured":"F. Tram\u00e8r , A. Kurakin , N. Papernot , D. Boneh , and P. McDaniel . Ensemble adversarial training: Attacks and defenses. arXiv preprint arXiv:1705.07204 , 2017 . F. Tram\u00e8r, A. Kurakin, N. Papernot, D. Boneh, and P. McDaniel. Ensemble adversarial training: Attacks and defenses. arXiv preprint arXiv:1705.07204, 2017."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/NTSP.2016.7747793"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"key":"e_1_3_2_1_68_1","volume-title":"Hashing for similarity search: A survey. CoRR, abs\/1408.2927","author":"Wang J.","year":"2014","unstructured":"J. Wang , H. T. Shen , J. Song , and J. Ji . Hashing for similarity search: A survey. CoRR, abs\/1408.2927 , 2014 . J. Wang, H. T. Shen, J. Song, and J. Ji. Hashing for similarity search: A survey. CoRR, abs\/1408.2927, 2014."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502100"},{"key":"e_1_3_2_1_70_1","volume-title":"Google's neural machine translation system: Bridging the gap between human and machine translation. arXiv preprint arXiv:1609.08144","author":"Wu Y.","year":"2016","unstructured":"Y. Wu , M. Schuster , Z. Chen , Q. V. Le , M. Norouzi , W. Macherey , M. Krikun , Y. Cao , Q. Gao , K. Macherey , Google's neural machine translation system: Bridging the gap between human and machine translation. arXiv preprint arXiv:1609.08144 , 2016 . Y. Wu, M. Schuster, Z. Chen, Q. V. Le, M. Norouzi, W. Macherey, M. Krikun, Y. Cao, Q. Gao, K. Macherey, et al. Google's neural machine translation system: Bridging the gap between human and machine translation. arXiv preprint arXiv:1609.08144, 2016."},{"key":"e_1_3_2_1_71_1","first-page":"2985","volume-title":"NIPS","author":"You S.","year":"2017","unstructured":"S. You , D. Ding , K. Canini , J. Pfeifer , and M. Gupta . Deep lattice networks and partial monotonic functions . In NIPS , pages 2985 -- 2993 , 2017 . S. You, D. Ding, K. Canini, J. Pfeifer, and M. Gupta. Deep lattice networks and partial monotonic functions. In NIPS, pages 2985--2993, 2017."},{"key":"e_1_3_2_1_72_1","volume-title":"Imagenet training in minutes. CoRR, abs\/1709.05011","author":"You Y.","year":"2017","unstructured":"Y. You , Z. Zhang , C. Hsieh , J. Demmel , and K. Keutzer . Imagenet training in minutes. CoRR, abs\/1709.05011 , 2017 . Y. You, Z. Zhang, C. Hsieh, J. Demmel, and K. Keutzer. Imagenet training in minutes. CoRR, abs\/1709.05011, 2017."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025120"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055335"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915222"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA","acronym":"SIGMOD\/PODS '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196909","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196909","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:39:18Z","timestamp":1750196358000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":75,"alternative-id":["10.1145\/3183713.3196909","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3196909","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}