{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:45Z","timestamp":1750220745478,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"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:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3389729","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"2423-2437","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["External Merge Sort for Top-K Queries"],"prefix":"10.1145","author":[{"given":"Yannis","family":"Chronis","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanh","family":"Do","sequence":"additional","affiliation":[{"name":"Google Inc, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goetz","family":"Graefe","sequence":"additional","affiliation":[{"name":"Google Inc, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keith","family":"Peters","sequence":"additional","affiliation":[{"name":"Google Inc, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989328"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"e_1_3_2_2_3_1","unstructured":"Dominik Brodowski and N Golde. 2016. Linux CPUFreq governors. http:\/\/www.mjmwired.net\/kernel\/Documentation\/cpufreq\/governors.txt (2016).  Dominik Brodowski and N Golde. 2016. Linux CPUFreq governors. http:\/\/www.mjmwired.net\/kernel\/Documentation\/cpufreq\/governors.txt (2016)."},{"key":"e_1_3_2_2_4_1","first-page":"12","article-title":"Processing top n and bottom n queries","volume":"20","author":"Carey Michael J.","year":"1997","unstructured":"Michael J. Carey and Donald Kossmann . 1997 . Processing top n and bottom n queries . IEEE Data Eng. Bull. , Vol. 20 , 3 (1997), 12 -- 19 . Michael J. Carey and Donald Kossmann. 1997. Processing top n and bottom n queries. IEEE Data Eng. Bull., Vol. 20, 3 (1997), 12--19.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_3_2_2_5_1","first-page":"24","article-title":"Reducing the braking distance of an SQL query engine","volume":"98","author":"Carey Michael J","year":"1998","unstructured":"Michael J Carey and Donald Kossmann . 1998 . Reducing the braking distance of an SQL query engine . In VLDB , Vol. 98. 24 -- 27 . Michael J Carey and Donald Kossmann. 1998. Reducing the braking distance of an SQL query engine. In VLDB, Vol. 98. 24--27.","journal-title":"VLDB"},{"key":"e_1_3_2_2_6_1","volume-title":"Seventh International Conference on Data Engineering. IEEE, 171--180","author":"Cheng Josephine","year":"1991","unstructured":"Josephine Cheng , Don Haderle , Richard Hedges , Balakrishna R Iyer , Ted Messinger , C Mohan , and Yun Wang . 1991 . An efficient hybrid join algorithm: A DB2 prototype. In [1991] Proceedings . Seventh International Conference on Data Engineering. IEEE, 171--180 . Josephine Cheng, Don Haderle, Richard Hedges, Balakrishna R Iyer, Ted Messinger, C Mohan, and Yun Wang. 1991. An efficient hybrid join algorithm: A DB2 prototype. In [1991] Proceedings. Seventh International Conference on Data Engineering. IEEE, 171--180."},{"key":"e_1_3_2_2_7_1","volume-title":"Cosma Rohilla Shalizi, and Mark EJ Newman","author":"Clauset Aaron","year":"2009","unstructured":"Aaron Clauset , Cosma Rohilla Shalizi, and Mark EJ Newman . 2009 . Power-law distributions in empirical data. SIAM review, Vol. 51 , 4 (2009), 661--703. Aaron Clauset, Cosma Rohilla Shalizi, and Mark EJ Newman. 2009. Power-law distributions in empirical data. SIAM review, Vol. 51, 4 (2009), 661--703."},{"key":"e_1_3_2_2_8_1","volume-title":"TPC-H benchmark specification. Published at http:\/\/www. tcp. org\/hspec. html","author":"Transaction Processing Performance Council","year":"2008","unstructured":"Transaction Processing Performance Council . 2008. TPC-H benchmark specification. Published at http:\/\/www. tcp. org\/hspec. html , Vol. 21 ( 2008 ), 592--603. Transaction Processing Performance Council. 2008. TPC-H benchmark specification. Published at http:\/\/www. tcp. org\/hspec. html, Vol. 21 (2008), 592--603."},{"key":"e_1_3_2_2_9_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. arXiv preprint arXiv:1905.08898 (2019). 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. arXiv preprint arXiv:1905.08898 (2019)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902308"},{"key":"e_1_3_2_2_11_1","unstructured":"Christos Faloutsos and HV Jagadish. 1992. On B-tree indices for skewed distributions. (1992).  Christos Faloutsos and HV Jagadish. 1992. On B-tree indices for skewed distributions. (1992)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/152610.152611"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132960.1132964"},{"key":"e_1_3_2_2_14_1","volume-title":"Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on. IEEE, 548--555","author":"Graefe Goetz","year":"2008","unstructured":"Goetz Graefe . 2008 . A general and efficient algorithm for \"top\" queries . In Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on. IEEE, 548--555 . Goetz Graefe. 2008. A general and efficient algorithm for \"top\" queries. In Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on. IEEE, 548--555."},{"key":"e_1_3_2_2_15_1","unstructured":"Julian Huxley Richard E Strauss and Frederick B Churchill. 1932. Problems of relative growth. (1932).  Julian Huxley Richard E Strauss and Frederick B Churchill. 1932. Problems of relative growth. (1932)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_3_2_2_17_1","unstructured":"Business Insider. 2019. Facebook Photos Statistics. https:\/\/www.businessinsider.com\/facebook-350-million-photos-each-day-2013--9 Retrieved 02\/16\/2019 from  Business Insider. 2019. Facebook Photos Statistics. https:\/\/www.businessinsider.com\/facebook-350-million-photos-each-day-2013--9 Retrieved 02\/16\/2019 from"},{"key":"e_1_3_2_2_18_1","unstructured":"Business Insider. 2020. Amazon Prime Users Statistics. https:\/\/www.businessinsider.com\/amazon-more-than-100-million-prime-members-us-survey-2019--1 Retrieved 04\/09\/2020 from  Business Insider. 2020. Amazon Prime Users Statistics. https:\/\/www.businessinsider.com\/amazon-more-than-100-million-prime-members-us-survey-2019--1 Retrieved 04\/09\/2020 from"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989355"},{"volume-title":"The art of computer programming: sorting and searching","author":"Knuth Donald Ervin","key":"e_1_3_2_2_20_1","unstructured":"Donald Ervin Knuth . 1973. The art of computer programming: sorting and searching . Vol. 3 . Pearson Education . Donald Ervin Knuth. 1973. The art of computer programming: sorting and searching. Vol. 3. Pearson Education."},{"volume-title":"SQL, inProc. of the 1997 ACM-SIGMOD Conference on Management of Data'","author":"Kossmann D","key":"e_1_3_2_2_21_1","unstructured":"D Kossmann and M Carey . 1997. On saying \"enough already! \". In SQL, inProc. of the 1997 ACM-SIGMOD Conference on Management of Data' , Tucson, Arizona . D Kossmann and M Carey. 1997. On saying \"enough already!\". In SQL, inProc. of the 1997 ACM-SIGMOD Conference on Management of Data', Tucson, Arizona ."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066173"},{"key":"e_1_3_2_2_24_1","first-page":"14","article-title":"Zipf's Law everywhere","volume":"5","author":"Li Wentian","year":"2002","unstructured":"Wentian Li . 2002 . Zipf's Law everywhere . Glottometrics , Vol. 5 (2002), 14 -- 21 . Wentian Li. 2002. Zipf's Law everywhere. Glottometrics, Vol. 5 (2002), 14--21.","journal-title":"Glottometrics"},{"key":"e_1_3_2_2_25_1","volume-title":"2013 IEEE Symposium on Computers and Communications (ISCC). IEEE, 000612--000617","author":"Mi Tian","year":"2013","unstructured":"Tian Mi and Sanguthevar Rajasekaran . 2013 . A two-pass exact algorithm for selection on Parallel Disk Systems . In 2013 IEEE Symposium on Computers and Communications (ISCC). IEEE, 000612--000617 . Tian Mi and Sanguthevar Rajasekaran. 2013. A two-pass exact algorithm for selection on Parallel Disk Systems. In 2013 IEEE Symposium on Computers and Communications (ISCC). IEEE, 000612--000617."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191884"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01354877"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1603899.1603924"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229871"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183735"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233320"},{"key":"e_1_3_2_2_32_1","unstructured":"Internet Live Stats. 2020. Twitter statistics. https:\/\/www.internetlivestats.com\/twitter-statistics\/ Retrieved 04\/09\/2020 from  Internet Live Stats. 2020. Twitter statistics. https:\/\/www.internetlivestats.com\/twitter-statistics\/ Retrieved 04\/09\/2020 from"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300075"},{"key":"e_1_3_2_2_34_1","unstructured":"The Verge. 2019. Google's billion user services. https:\/\/www.theverge.com\/2019\/7\/24\/20708328\/google-photos-users-gallery-go-1-billion Retrieved 04\/09\/2020 from  The Verge. 2019. Google's billion user services. https:\/\/www.theverge.com\/2019\/7\/24\/20708328\/google-photos-users-gallery-go-1-billion Retrieved 04\/09\/2020 from"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487663"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Portland OR USA","acronym":"SIGMOD\/PODS '20"},"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.3389729","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389729","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.3389729"}},"subtitle":["Eager input filtering guided by histograms"],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":35,"alternative-id":["10.1145\/3318464.3389729","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3389729","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"}}]}}