{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:58:13Z","timestamp":1781078293574,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["412400621"],"award-info":[{"award-number":["412400621"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,14]]},"DOI":"10.1145\/3375395.3387662","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T15:10:29Z","timestamp":1590765029000},"page":"393-409","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration"],"prefix":"10.1145","author":[{"given":"Nofar","family":"Carmeli","sequence":"first","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shai","family":"Zeevi","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Berkholz","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benny","family":"Kimelfeld","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicole","family":"Schweikardt","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304207"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514909"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392389.2392412"},{"key":"e_1_3_2_1_7_1","first-page":"1","volume-title":"ICDT","author":"Berkholz C.","year":"2018","unstructured":"C. Berkholz , J. Keppeler , and N. Schweikardt . Answering UCQs under updates and in the presence of integrity constraints . In ICDT , pages 1 -- 19 , 2018 . C. Berkholz, J. Keppeler, and N. Schweikardt. Answering UCQs under updates and in the presence of integrity constraints. In ICDT, pages 1--19, 2018."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.06.038"},{"key":"e_1_3_2_1_10_1","first-page":"1","volume-title":"ICDT","author":"Carmeli N.","year":"2018","unstructured":"N. Carmeli and M. Kr\u00f6 ll. Enumeration complexity of conjunctive queries with functional dependencies . In ICDT , pages 11: 1 -- 11 :17, 2018 . N. Carmeli and M. Kr\u00f6 ll. Enumeration complexity of conjunctive queries with functional dependencies. In ICDT, pages 11:1--11:17, 2018."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319700"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304206"},{"key":"e_1_3_2_1_13_1","first-page":"1","volume-title":"23rd International Conference on Database Theory, ICDT 2020","volume":"155","author":"Chen Y.","year":"2020","unstructured":"Y. Chen and K. Yi . Random sampling and size estimation over cyclic joins. In C. Lutz and J. C. Jung, editors , 23rd International Conference on Database Theory, ICDT 2020 , March 30-April 2, 2020 , Copenhagen, Denmark , volume 155 of LIPIcs, pages 7: 1 -- 7 :18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 2020. Y. Chen and K. Yi. Random sampling and size estimation over cyclic joins. In C. Lutz and J. C. Jung, editors, 23rd International Conference on Database Theory, ICDT 2020, March 30-April 2, 2020, Copenhagen, Denmark, volume 155 of LIPIcs, pages 7:1--7:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 2020."},{"key":"e_1_3_2_1_14_1","volume-title":"Ranked enumeration of conjunctive query results. CoRR, abs\/1902.02698","author":"Deep S.","year":"2019","unstructured":"S. Deep and P. Koutris . Ranked enumeration of conjunctive query results. CoRR, abs\/1902.02698 , 2019 . S. Deep and P. Koutris. Ranked enumeration of conjunctive query results. CoRR, abs\/1902.02698, 2019."},{"key":"e_1_3_2_1_15_1","series-title":"LIPIcs","first-page":"189","volume-title":"CSL","author":"Durand A.","year":"2011","unstructured":"A. Durand and Y. Strozecki . Enumeration complexity of logical query problems with second-order variables . In CSL , volume 12 of LIPIcs , pages 189 -- 202 , 2011 . A. Durand and Y. Strozecki. Enumeration complexity of logical query problems with second-order variables. In CSL, volume 12 of LIPIcs, pages 189--202, 2011."},{"key":"e_1_3_2_1_16_1","volume-title":"Algorithm 235: Random permutation. C. ACM, 7(7):420","author":"Durstenfeld R.","year":"1964","unstructured":"R. Durstenfeld . Algorithm 235: Random permutation. C. ACM, 7(7):420 , 1964 . R. Durstenfeld. Algorithm 235: Random permutation. C. ACM, 7(7):420, 1964."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602222"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376708"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304208"},{"key":"e_1_3_2_1_21_1","first-page":"670","volume-title":"VLDB","author":"Hristidis V.","year":"2002","unstructured":"V. Hristidis and Y. Papakonstantinou . DISCOVER: keyword search in relational databases . In VLDB , pages 670 -- 681 . Morgan Kaufmann , 2002 . V. Hristidis and Y. Papakonstantinou. DISCOVER: keyword search in relational databases. In VLDB, pages 670--681. Morgan Kaufmann, 2002."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064027"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90038-2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3284551"},{"key":"e_1_3_2_1_25_1","first-page":"1236","volume-title":"Proc. SODA","author":"Lincoln A.","year":"2018","unstructured":"A. Lincoln , V. V. Williams , and R. Williams . Tight hardness for shortest cycles and paths in sparse graphs . In Proc. SODA , pages 1236 -- 1252 . SIAM , 2018 . A. Lincoln, V. V. Williams, and R. Williams. Tight hardness for shortest cycles and paths in sparse graphs. In Proc. SODA, pages 1236--1252. SIAM, 2018."},{"key":"e_1_3_2_1_26_1","volume-title":"Benjamin-Cummings","author":"Moret B. M. E.","year":"1991","unstructured":"B. M. E. Moret and H. D. Shapiro . Algorithms from P to NP: Volume 1: Design & Efficiency . Benjamin-Cummings , 1991 . B. M. E. Moret and H. D. Shapiro. Algorithms from P to NP: Volume 1: Design & Efficiency. Benjamin-Cummings, 1991."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656335"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502568"},{"key":"e_1_3_2_1_29_1","volume-title":"Optimal algorithms for ranked enumeration of answers to full conjunctive queries. CoRR, abs\/1911.05582","author":"Tziavelis N.","year":"2019","unstructured":"N. Tziavelis , D. Ajwani , W. Gatterbauer , M. Riedewald , and X. Yang . Optimal algorithms for ranked enumeration of answers to full conjunctive queries. CoRR, abs\/1911.05582 , 2019 . N. Tziavelis, D. Ajwani, W. Gatterbauer, M. Riedewald, and X. Yang. Optimal algorithms for ranked enumeration of answers to full conjunctive queries. CoRR, abs\/1911.05582, 2019."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.26"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_3_2_1_32_1","first-page":"82","volume-title":"VLDB '81","author":"Yannakakis M.","year":"1981","unstructured":"M. Yannakakis . Algorithms for acyclic database schemes. In VLDB , VLDB '81 , pages 82 -- 94 . VLDB Endowment , 1981 . M. Yannakakis. Algorithms for acyclic database schemes. In VLDB, VLDB '81, pages 82--94. VLDB Endowment, 1981."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183739"}],"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 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387662","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3375395.3387662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:49Z","timestamp":1750199569000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":32,"alternative-id":["10.1145\/3375395.3387662","10.1145\/3375395"],"URL":"https:\/\/doi.org\/10.1145\/3375395.3387662","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}