{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T23:19:50Z","timestamp":1767827990672,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,18]],"date-time":"2023-06-18T00:00:00Z","timestamp":1687046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Korea government (MSIT)","award":["2021-0-00859, 2018-0-01398, NRF-2021R1A2B5B03001551"],"award-info":[{"award-number":["2021-0-00859, 2018-0-01398, NRF-2021R1A2B5B03001551"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,18]]},"DOI":"10.1145\/3584372.3588676","type":"proceedings-article","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T22:21:22Z","timestamp":1685744482000},"page":"113-125","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Guaranteeing the \u00d5(AGM\/OUT) Runtime for Uniform Sampling and Size Estimation over Joins"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-0224-2570","authenticated-orcid":false,"given":"Kyoungmin","family":"Kim","sequence":"first","affiliation":[{"name":"Pohang University of Science and Technology (POSTECH), Pohang, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1815-3320","authenticated-orcid":false,"given":"Jaehyun","family":"Ha","sequence":"additional","affiliation":[{"name":"Pohang University of Science and Technology (POSTECH), Pohang, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2111-6769","authenticated-orcid":false,"given":"George","family":"Fletcher","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology (TU\/e), Eindhoven, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9206-9563","authenticated-orcid":false,"given":"Wook-Shin","family":"Han","sequence":"additional","affiliation":[{"name":"Pohang University of Science and Technology (POSTECH), Pohang, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2023,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902280"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056105"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0287-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451014"},{"key":"e_1_3_2_1_6_1","volume-title":"ITCS","author":"Assadi Sepehr","year":"2019","unstructured":"Sepehr Assadi, Michael Kapralov, and Sanjeev Khanna. 2019. A simple sublineartime algorithm for counting arbitrary subgraphs via edge sampling. In 10th Innovations in Theoretical Computer Science, ITCS 2019. Schloss Dagstuhl-Leibniz- Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"e_1_3_2_1_8_1","volume-title":"34th Symposium on Theoretical Aspects of Computer Science.","author":"Bera Suman K","year":"2017","unstructured":"Suman K Bera and Amit Chakrabarti. 2017. Towards tighter space bounds for counting triangles and other substructures in graph streams. In 34th Symposium on Theoretical Aspects of Computer Science."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983573"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387662"},{"key":"e_1_3_2_1_11_1","volume-title":"Random Sampling and Size Estimation Over Cyclic Joins. In 23rd International Conference on Database Theory (ICDT","author":"Chen Yu","year":"2020","unstructured":"Yu Chen and Ke Yi. 2020. Random Sampling and Size Estimation Over Cyclic Joins. In 23rd International Conference on Database Theory (ICDT 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3584372.3588666"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1054389"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1176701"},{"key":"e_1_3_2_1_15_1","unstructured":"Hendrik Fichtenberger Mingze Gao and Pan Peng. 2020. Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. In ICALP."},{"key":"e_1_3_2_1_16_1","unstructured":"Jacob Focke Leslie Ann Goldberg Marc Roth and Stanislav Zivn"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. 315--324","year":"2022","unstructured":"y. 2022. Approximately counting answers to conjunctive queries with disequalities and negations. In Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. 315--324."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02780332"},{"key":"e_1_3_2_1_19_1","volume-title":"Introduction to property testing","author":"Goldreich Oded","unstructured":"Oded Goldreich. 2017. Introduction to property testing. Cambridge University Press."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265535"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2636918"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1952.10483446"},{"key":"e_1_3_2_1_25_1","volume-title":"Random generation of combinatorial structures from a uniform distribution. Theoretical computer science 43","author":"Jerrum Mark R","year":"1986","unstructured":"Mark R Jerrum, Leslie G Valiant, and Vijay V Vazirani. 1986. Random generation of combinatorial structures from a uniform distribution. Theoretical computer science 43 (1986), 169--188."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902293"},{"key":"e_1_3_2_1_27_1","volume-title":"full paper. arXiv preprint arXiv:2304.00715","author":"Kim Kyoungmin","year":"2023","unstructured":"Kyoungmin Kim, Jaehyun Ha, George Fletcher, and Wook-Shin Han. 2023. full paper. arXiv preprint arXiv:2304.00715 (2023)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457246"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915235"},{"key":"e_1_3_2_1_31_1","unstructured":"Hung Q Ngo Ely Porat Christopher R\u00e9 and Atri Rudra. 2012. Worst-case Optimal Join Algorithms. (2012)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_3_2_1_33_1","volume-title":"Leapfrog triejoin: a worst-case optimal join algorithm. arXiv preprint arXiv:1210.0481","author":"Veldhuizen Todd L","year":"2012","unstructured":"Todd L Veldhuizen. 2012. Leapfrog triejoin: a worst-case optimal join algorithm. arXiv preprint arXiv:1210.0481 (2012)."},{"key":"e_1_3_2_1_34_1","first-page":"82","article-title":"Algorithms for acyclic database schemes","volume":"81","author":"Yannakakis Mihalis","year":"1981","unstructured":"Mihalis Yannakakis. 1981. Algorithms for acyclic database schemes. In VLDB, Vol. 81. 82--94.","journal-title":"VLDB"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183739"}],"event":{"name":"SIGMOD\/PODS '23: International Conference on Management of Data","location":"Seattle WA USA","acronym":"SIGMOD\/PODS '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588676","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584372.3588676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:28Z","timestamp":1750178788000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584372.3588676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,18]]},"references-count":35,"alternative-id":["10.1145\/3584372.3588676","10.1145\/3584372"],"URL":"https:\/\/doi.org\/10.1145\/3584372.3588676","relation":{},"subject":[],"published":{"date-parts":[[2023,6,18]]},"assertion":[{"value":"2023-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}