{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T23:47:13Z","timestamp":1778802433741,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["NSF IIS 1900933"],"award-info":[{"award-number":["NSF IIS 1900933"]}]},{"name":"DARPA","award":["16-43-D3M-FP040"],"award-info":[{"award-number":["16-43-D3M-FP040"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3389752","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"1001-1016","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["The Case for a Learned Sorting Algorithm"],"prefix":"10.1145","author":[{"given":"Ani","family":"Kristo","sequence":"first","affiliation":[{"name":"Brown University, Providence, RI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kapil","family":"Vaidya","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugur","family":"\u00c7etintemel","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanchit","family":"Misra","sequence":"additional","affiliation":[{"name":"Intel Labs, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Kraska","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Apple. 2018. Apple\/Swift: standard library sort. (2018). https:\/\/github.com\/apple\/swift\/blob\/master\/test\/Prototypes\/IntroSort.swift  Apple. 2018. Apple\/Swift: standard library sort. (2018). https:\/\/github.com\/apple\/swift\/blob\/master\/test\/Prototypes\/IntroSort.swift"},{"key":"e_1_3_2_2_2_1","volume-title":"25th Annual European Symposium on Algorithms (ESA 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Kirk Pruhs and Christian Sohler (Eds.)","volume":"87","author":"Axtmann Michael","year":"2017","unstructured":"Michael Axtmann , Sascha Witt , Daniel Ferizovic , and Peter Sanders . 2017 . In-Place Parallel Super Scalar Samplesort (IPSSSSo) . In 25th Annual European Symposium on Algorithms (ESA 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Kirk Pruhs and Christian Sohler (Eds.) , Vol. 87 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 9:1--9:14. https:\/\/doi.org\/10.4230\/LIPIcs.ESA. 2017.9 Michael Axtmann, Sascha Witt, Daniel Ferizovic, and Peter Sanders. 2017. In-Place Parallel Super Scalar Samplesort (IPSSSSo). In 25th Annual European Symposium on Algorithms (ESA 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Kirk Pruhs and Christian Sohler (Eds.), Vol. 87. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 9:1--9:14. https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2017.9"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732227"},{"key":"e_1_3_2_2_4_1","volume-title":"https:\/\/www.nist.gov\/dads\/HTML\/histogramSort.html","author":"Black Paul E.","year":"2019","unstructured":"Paul E. Black . 2019. Histogram Sort . ( 2019 ). https:\/\/www.nist.gov\/dads\/HTML\/histogramSort.html Paul E. Black. 2019. Histogram Sort. (2019). https:\/\/www.nist.gov\/dads\/HTML\/histogramSort.html"},{"key":"e_1_3_2_2_5_1","volume-title":"Fast sorting algorithms using AVX-512 on Intel Knights Landing. arXiv preprint arXiv:1704.08579","author":"Bramas Berenger","year":"2017","unstructured":"Berenger Bramas . 2017. Fast sorting algorithms using AVX-512 on Intel Knights Landing. arXiv preprint arXiv:1704.08579 , Vol. 305 ( 2017 ), 315. Berenger Bramas. 2017. Fast sorting algorithms using AVX-512 on Intel Knights Landing. arXiv preprint arXiv:1704.08579, Vol. 305 (2017), 315."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824050"},{"key":"e_1_3_2_2_7_1","volume-title":"Introduction to algorithms 2 ed.)","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2007. Introduction to algorithms 2 ed.) . MIT Press , Cambridge, MA . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2007. Introduction to algorithms 2 ed.). MIT Press, Cambridge, MA."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90220-P"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1996.570344"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791194094"},{"key":"e_1_3_2_2_11_1","volume-title":"Hantian Zhang, Yinan Li, Chi Wang, Badrish Chandramouli, Johannes Gehrke, Donald Kossmann, and David Lomet.","author":"Ding Jialin","year":"2019","unstructured":"Jialin Ding , Umar Farooq Minhas , Hantian Zhang, Yinan Li, Chi Wang, Badrish Chandramouli, Johannes Gehrke, Donald Kossmann, and David Lomet. 2019 . ALEX : An Updatable Adaptive Learned Index . (2019). arxiv: cs.DB\/1905.08898 Jialin Ding, Umar Farooq Minhas, Hantian Zhang, Yinan Li, Chi Wang, Badrish Chandramouli, Johannes Gehrke, Donald Kossmann, and David Lomet. 2019. ALEX: An Updatable Adaptive Learned Index. (2019). arxiv: cs.DB\/1905.08898"},{"key":"e_1_3_2_2_12_1","volume-title":"Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator. Ann. Math. Statist.","volume":"27","author":"Dvoretzky A.","year":"1956","unstructured":"A. Dvoretzky , J. Kiefer , and J. Wolfowitz . 1956 . Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator. Ann. Math. Statist. , Vol. 27 , 3 (09 1956 ), 642--669. https:\/\/doi.org\/10.1214\/aoms\/1177728174 A. Dvoretzky, J. Kiefer, and J. Wolfowitz. 1956. Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator. Ann. Math. Statist., Vol. 27, 3 (09 1956), 642--669. https:\/\/doi.org\/10.1214\/aoms\/1177728174"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-013-0436-7"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248436"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319860"},{"key":"e_1_3_2_2_16_1","unstructured":"GNU. 2009. C+: STL sort. (2009). https:\/\/gcc.gnu.org\/onlinedocs\/libstdc+\/libstdc+-html-USERS-4.4\/a01347.html  GNU. 2009. C+: STL sort. (2009). https:\/\/gcc.gnu.org\/onlinedocs\/libstdc+\/libstdc+-html-USERS-4.4\/a01347.html"},{"key":"e_1_3_2_2_17_1","unstructured":"Go. 2009. Source file src\/sort\/sort.go. (2009). https:\/\/golang.org\/src\/sort\/sort.go  Go. 2009. Source file src\/sort\/sort.go. (2009). https:\/\/golang.org\/src\/sort\/sort.go"},{"key":"e_1_3_2_2_18_1","volume-title":"https:\/\/github.com\/gfx\/cpp-TimSort","author":"Goro Fuji","year":"2019","unstructured":"Fuji Goro and Morwenn. 2019. Open-source C+ implementation of Timsort. ( 2019 ). https:\/\/github.com\/gfx\/cpp-TimSort Fuji Goro and Morwenn. 2019. Open-source C+ implementation of Timsort. (2019). https:\/\/github.com\/gfx\/cpp-TimSort"},{"key":"e_1_3_2_2_19_1","unstructured":"Jim Gray Chris Nyberg Mehul Shah and Naga Govindaraju. 2017. The SortBenchmark dataset. (2017). http:\/\/sortbenchmark.org\/  Jim Gray Chris Nyberg Mehul Shah and Naga Govindaraju. 2017. The SortBenchmark dataset. (2017). http:\/\/sortbenchmark.org\/"},{"key":"e_1_3_2_2_20_1","volume-title":"Learning-Based Frequency Estimation Algorithms. International Conference on Learning Representations. ICLR","author":"Hsu Chen-Yu","year":"2019","unstructured":"Chen-Yu Hsu , Piotr Indyk , Dina Katabi , and Ali Vakilian . 2019 . Learning-Based Frequency Estimation Algorithms. International Conference on Learning Representations. ICLR , New Orleans, LA. https:\/\/openreview.net\/forum?id=r1lohoCqY7 Chen-Yu Hsu, Piotr Indyk, Dina Katabi, and Ali Vakilian. 2019. Learning-Based Frequency Estimation Algorithms. International Conference on Learning Representations. ICLR, New Orleans, LA. https:\/\/openreview.net\/forum?id=r1lohoCqY7"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809988"},{"key":"e_1_3_2_2_22_1","unstructured":"Intel. 2020. Intel Performance Primitive library for x86 architectures. (2020). http:\/\/software.intel.com\/en-us\/intel-ipp\/  Intel. 2020. Intel Performance Primitive library for x86 architectures. (2020). http:\/\/software.intel.com\/en-us\/intel-ipp\/"},{"key":"e_1_3_2_2_23_1","unstructured":"Java. 2017. Java 9: List.sort. (2017). https:\/\/docs.oracle.com\/javase\/9\/docs\/api\/java\/util\/List.html#sort-java.util.Comparator-  Java. 2017. Java 9: List.sort. (2017). https:\/\/docs.oracle.com\/javase\/9\/docs\/api\/java\/util\/List.html#sort-java.util.Comparator-"},{"key":"e_1_3_2_2_24_1","unstructured":"Nathan Jay Noga H. Rotman P. Brighten Godfrey Michael Schapira and Aviv Tamar. 2018. Internet Congestion Control via Deep Reinforcement Learning. (2018). arxiv: cs.NI\/1810.03259  Nathan Jay Noga H. Rotman P. Brighten Godfrey Michael Schapira and Aviv Tamar. 2018. Internet Congestion Control via Deep Reinforcement Learning. (2018). arxiv: cs.NI\/1810.03259"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Johan Ludwig William Valdemar Jensen etal 1906. Sur les fonctions convexes et les in\u00e9galit\u00e9s entre les valeurs moyennes. Acta mathematica Vol. 30 (1906) 175--193.  Johan Ludwig William Valdemar Jensen et al. 1906. Sur les fonctions convexes et les in\u00e9galit\u00e9s entre les valeurs moyennes. Acta mathematica Vol. 30 (1906) 175--193.","DOI":"10.1007\/BF02418571"},{"key":"e_1_3_2_2_26_1","unstructured":"Jie Jiang Lixiong Zheng Junfeng Pu Xiong Cheng Chongqing Zhao Mark R Nutter and Jeremy D Schaub. 2017. Tencent Sort. (2017).  Jie Jiang Lixiong Zheng Junfeng Pu Xiong Cheng Chongqing Zhao Mark R Nutter and Jeremy D Schaub. 2017. Tencent Sort. (2017)."},{"key":"e_1_3_2_2_27_1","volume-title":"Learned Cardinalities: Estimating Correlated Joins with Deep Learning.","author":"Kipf Andreas","year":"2018","unstructured":"Andreas Kipf , Thomas Kipf , Bernhard Radke , Viktor Leis , Peter Boncz , and Alfons Kemper . 2018 . Learned Cardinalities: Estimating Correlated Joins with Deep Learning. (2018). arxiv: cs.DB\/1809.00677 Andreas Kipf, Thomas Kipf, Bernhard Radke, Viktor Leis, Peter Boncz, and Alfons Kemper. 2018. Learned Cardinalities: Estimating Correlated Joins with Deep Learning. (2018). arxiv: cs.DB\/1809.00677"},{"key":"e_1_3_2_2_28_1","volume-title":"Ani Kristo, Guillaume Leclerc, Samuel Madden, Hongzi Mao, and Vikram Nathan.","author":"Kraska Tim","year":"2019","unstructured":"Tim Kraska , Mohammad Alizadeh , Alex Beutel , Ed H. Chi , Ani Kristo, Guillaume Leclerc, Samuel Madden, Hongzi Mao, and Vikram Nathan. 2019 . SageDB: A Learned Database System. In CIDR 2019, 9th Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, January 13--16, 2019, Online Proceedings . www.cidrdb.org. http:\/\/cidrdb.org\/cidr2019\/papers\/p117-kraska-cidr19.pdf Tim Kraska, Mohammad Alizadeh, Alex Beutel, Ed H. Chi, Ani Kristo, Guillaume Leclerc, Samuel Madden, Hongzi Mao, and Vikram Nathan. 2019. SageDB: A Learned Database System. In CIDR 2019, 9th Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, January 13--16, 2019, Online Proceedings. www.cidrdb.org. http:\/\/cidrdb.org\/cidr2019\/papers\/p117-kraska-cidr19.pdf"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_2_2_30_1","volume-title":"Learning to optimize join queries with deep reinforcement learning. arXiv preprint arXiv:1808.03196","author":"Krishnan Sanjay","year":"2018","unstructured":"Sanjay Krishnan , Zongheng Yang , Ken Goldberg , Joseph Hellerstein , and Ion Stoica . 2018. Learning to optimize join queries with deep reinforcement learning. arXiv preprint arXiv:1808.03196 ( 2018 ). Sanjay Krishnan, Zongheng Yang, Ken Goldberg, Joseph Hellerstein, and Ion Stoica. 2018. Learning to optimize join queries with deep reinforcement learning. arXiv preprint arXiv:1808.03196 (2018)."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993744.1993773"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/39.6.547"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342080"},{"key":"e_1_3_2_2_34_1","first-page":"11","article-title":"Neo","volume":"12","author":"Marcus Ryan","year":"2019","unstructured":"Ryan Marcus , Parimarjan Negi , Hongzi Mao , Chi Zhang , Mohammad Alizadeh , Tim Kraska , Olga Papaemmanouil , and Nesime Tatbul . 2019 . Neo : A Learned Query Optimizer. Proc. VLDB Endow. , Vol. 12 , 11 (July 2019), 1705--1718. https:\/\/doi.org\/10.14778\/3342263.3342644 Ryan Marcus, Parimarjan Negi, Hongzi Mao, Chi Zhang, Mohammad Alizadeh, Tim Kraska, Olga Papaemmanouil, and Nesime Tatbul. 2019. Neo: A Learned Query Optimizer. Proc. VLDB Endow., Vol. 12, 11 (July 2019), 1705--1718. https:\/\/doi.org\/10.14778\/3342263.3342644","journal-title":"A Learned Query Optimizer. Proc. VLDB Endow."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3211954.3211957"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313859"},{"key":"e_1_3_2_2_37_1","unstructured":"MongoDB. 2018. MongoDB: sorter.cpp. (2018). https:\/\/github.com\/mongodb\/mongo\/blob\/master\/src\/mongo\/db\/sorter\/sorter.cpp  MongoDB. 2018. MongoDB: sorter.cpp. (2018). https:\/\/github.com\/mongodb\/mongo\/blob\/master\/src\/mongo\/db\/sorter\/sorter.cpp"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/261387.261395"},{"key":"e_1_3_2_2_39_1","unstructured":"MySQL. 2000. MySQL: filesort.cc. (2000). https:\/\/github.com\/mysql\/mysql-server\/blob\/8.0\/sql\/filesort.cc  MySQL. 2000. MySQL: filesort.cc. (2000). https:\/\/github.com\/mysql\/mysql-server\/blob\/8.0\/sql\/filesort.cc"},{"key":"e_1_3_2_2_40_1","volume-title":"Theoretically-Efficient and Practical Parallel In-Place Radix Sorting. In The 31st ACM on Symposium on Parallelism in Algorithms and Architectures. ACM, 213--224","author":"Obeya Omar","year":"2019","unstructured":"Omar Obeya , Endrias Kahssay , Edward Fan , and Julian Shun . 2019 . Theoretically-Efficient and Practical Parallel In-Place Radix Sorting. In The 31st ACM on Symposium on Parallelism in Algorithms and Architectures. ACM, 213--224 . Omar Obeya, Endrias Kahssay, Edward Fan, and Julian Shun. 2019. Theoretically-Efficient and Practical Parallel In-Place Radix Sorting. In The 31st ACM on Symposium on Parallelism in Algorithms and Architectures. ACM, 213--224."},{"key":"e_1_3_2_2_41_1","unstructured":"OpenAddresses. 2020. The OpenAddresses - Northeast dataset. (2020). https:\/\/data.openaddresses.io\/openaddr-collected-us_northeast.zip  OpenAddresses. 2020. The OpenAddresses - Northeast dataset. (2020). https:\/\/data.openaddresses.io\/openaddr-collected-us_northeast.zip"},{"key":"e_1_3_2_2_42_1","unstructured":"OpenStreetMap contributors. 2017. Planet dump retrieved from https:\/\/planet.osm.org. (2017). https:\/\/www.openstreetmap.org  OpenStreetMap contributors. 2017. Planet dump retrieved from https:\/\/planet.osm.org. (2017). https:\/\/www.openstreetmap.org"},{"key":"e_1_3_2_2_43_1","volume-title":"On estimation of a probability density function and mode. The annals of mathematical statistics","author":"Parzen Emanuel","year":"1962","unstructured":"Emanuel Parzen . 1962. On estimation of a probability density function and mode. The annals of mathematical statistics , Vol. 33 , 3 ( 1962 ), 1065--1076. Emanuel Parzen. 1962. On estimation of a probability density function and mode. The annals of mathematical statistics, Vol. 33, 3 (1962), 1065--1076."},{"key":"e_1_3_2_2_44_1","unstructured":"Orson R. L. Peters. 2020. The Pattern-Defeating Quicksort Algorithm. (2020). https:\/\/github.com\/orlp\/pdqsort  Orson R. L. Peters. 2020. The Pattern-Defeating Quicksort Algorithm. (2020). https:\/\/github.com\/orlp\/pdqsort"},{"key":"e_1_3_2_2_45_1","unstructured":"Tim Peters. 2002. Python: list.sort. (2002). https:\/\/github.com\/python\/cpython\/blob\/master\/Objects\/listsort.txt  Tim Peters. 2002. Python: list.sort. (2002). https:\/\/github.com\/python\/cpython\/blob\/master\/Objects\/listsort.txt"},{"key":"e_1_3_2_2_46_1","unstructured":"Postgres. 1996. Postgres: tuplesort.c. (1996). https:\/\/github.com\/postgres\/postgres\/blob\/master\/src\/backend\/utils\/sort\/tuplesort.c  Postgres. 1996. Postgres: tuplesort.c. (1996). https:\/\/github.com\/postgres\/postgres\/blob\/master\/src\/backend\/utils\/sort\/tuplesort.c"},{"key":"e_1_3_2_2_47_1","volume-title":"Remarks on some nonparametric estimates of a density function. The Annals of Mathematical Statistics","author":"Rosenblatt Murray","year":"1956","unstructured":"Murray Rosenblatt . 1956. Remarks on some nonparametric estimates of a density function. The Annals of Mathematical Statistics ( 1956 ), 832--837. Murray Rosenblatt. 1956. Remarks on some nonparametric estimates of a density function. The Annals of Mathematical Statistics (1956), 832--837."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_69"},{"key":"e_1_3_2_2_49_1","volume-title":"https:\/\/github.com\/SaschaWitt\/ips4o","author":"Sascha Witt Michael Axtmann","year":"2020","unstructured":"Michael Axtmann Sascha Witt . 2020. Open-source C+ implementation of the IPS4o algorithm. ( 2020 ). https:\/\/github.com\/SaschaWitt\/ips4o Michael Axtmann Sascha Witt. 2020. Open-source C+ implementation of the IPS4o algorithm. (2020). https:\/\/github.com\/SaschaWitt\/ips4o"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807207"},{"key":"e_1_3_2_2_51_1","volume-title":"https:\/\/bitbucket.org\/ais\/usort\/src\/474cc2a19224\/usort\/f8_sort.c","author":"Schein Andrew","year":"2009","unstructured":"Andrew Schein . 2009. Open-source C+ implementation of Radix Sort for double-precision floating points. ( 2009 ). https:\/\/bitbucket.org\/ais\/usort\/src\/474cc2a19224\/usort\/f8_sort.c Andrew Schein. 2009. Open-source C+ implementation of Radix Sort for double-precision floating points. (2009). https:\/\/bitbucket.org\/ais\/usort\/src\/474cc2a19224\/usort\/f8_sort.c"},{"key":"e_1_3_2_2_52_1","unstructured":"SQLite. 2011. SQLite: vdbesort.c. (2011). https:\/\/github.com\/mackyle\/sqlite\/blob\/master\/src\/vdbesort.c  SQLite. 2011. SQLite: vdbesort.c. (2011). https:\/\/github.com\/mackyle\/sqlite\/blob\/master\/src\/vdbesort.c"},{"key":"e_1_3_2_2_53_1","unstructured":"Simon Steele and Marius vZil\u00e9nas. 2020. 479k English words for all your dictionary. (2020). https:\/\/github.com\/dwyl\/english-words  Simon Steele and Marius vZil\u00e9nas. 2020. 479k English words for all your dictionary. (2020). https:\/\/github.com\/dwyl\/english-words"},{"key":"e_1_3_2_2_54_1","volume-title":"Hash function generation by neural network. In 2016 New Trends in Signal Processing (NTSP)","author":"Martin Javurek Michal Turvc","unstructured":"Michal Turvc an'ik and Martin Javurek . 2016. Hash function generation by neural network. In 2016 New Trends in Signal Processing (NTSP) . IEEE , 1--5. Michal Turvc an'ik and Martin Javurek. 2016. Hash function generation by neural network. In 2016 New Trends in Signal Processing (NTSP). IEEE, 1--5."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300075"},{"key":"e_1_3_2_2_56_1","volume-title":"Jingkuan Song, and Jianqiu Ji.","author":"Wang Jingdong","year":"2014","unstructured":"Jingdong Wang , Heng Tao Shen , Jingkuan Song, and Jianqiu Ji. 2014 . Hashing for similarity search: A survey. arXiv preprint arXiv:1408.2927 (2014). Jingdong Wang, Heng Tao Shen, Jingkuan Song, and Jianqiu Ji. 2014. Hashing for similarity search: A survey. arXiv preprint arXiv:1408.2927 (2014)."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502100"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.14778\/3291264.3291267"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389752","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389752","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:44Z","timestamp":1750199924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":58,"alternative-id":["10.1145\/3318464.3389752","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3389752","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}