{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T05:28:07Z","timestamp":1758259687628,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,20]],"date-time":"2021-06-20T00:00:00Z","timestamp":1624147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["IIS-1956096,CAREER IIS-1762268"],"award-info":[{"award-number":["IIS-1956096,CAREER IIS-1762268"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["PhD fellowship"],"award-info":[{"award-number":["PhD fellowship"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"name":"German Research Foundation (DFG)","award":["Project 412400621 (DIP program)"],"award-info":[{"award-number":["Project 412400621 (DIP program)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,20]]},"DOI":"10.1145\/3452021.3458331","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T14:21:58Z","timestamp":1624026118000},"page":"325-341","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries"],"prefix":"10.1145","author":[{"given":"Nofar","family":"Carmeli","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Nikolaos","family":"Tziavelis","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]},{"given":"Wolfgang","family":"Gatterbauer","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]},{"given":"Benny","family":"Kimelfeld","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Mirek","family":"Riedewald","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1059513.1059515"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--74915--8_18"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Ilya Baran Erik D. Demaine and Mihai Patracu. 2005. Subquadratic Algorithms for 3SUM. In Algorithms and Data Structures. 409--421. https:\/\/doi.org\/10.1007\/ 11534273_36  Ilya Baran Erik D. Demaine and Mihai Patracu. 2005. Subquadratic Algorithms for 3SUM. In Algorithms and Data Structures. 409--421. https:\/\/doi.org\/10.1007\/ 11534273_36","DOI":"10.1007\/11534273_36"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385634.3385636"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033--9"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2021.20"},{"key":"e_1_3_2_2_9_1","first-page":"828","article-title":"Enumeration Complexity of Conjunctive Queries with Functional Dependencies","volume":"64","author":"Carmeli Nofar","year":"2020","unstructured":"Nofar Carmeli and Markus Kr\u00f6ll . 2020 . Enumeration Complexity of Conjunctive Queries with Functional Dependencies . TCS 64 , 5 (2020), 828 -- 860 . https:\/\/doi. org\/10.1007\/s00224-019-09937--9 Nofar Carmeli and Markus Kr\u00f6ll. 2020. Enumeration Complexity of Conjunctive Queries with Functional Dependencies. TCS 64, 5 (2020), 828--860. https:\/\/doi. org\/10.1007\/s00224-019-09937--9","journal-title":"TCS"},{"key":"e_1_3_2_2_10_1","unstructured":"Nofar Carmeli Shai Zeevi Christoph Berkholz Benny Kimelfeld and Nicole Schweikardt. 2020. Answering (Unions of) Conjunctive Queries Using Random Access and Random-Order Enumeration. In PODS. 393--409. https:\/\/doi.org\/10. 1145\/3375395.3387662  Nofar Carmeli Shai Zeevi Christoph Berkholz Benny Kimelfeld and Nicole Schweikardt. 2020. Answering (Unions of) Conjunctive Queries Using Random Access and Random-Order Enumeration. In PODS. 393--409. https:\/\/doi.org\/10. 1145\/3375395.3387662"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT"},{"key":"e_1_3_2_2_12_1","unstructured":"Jeff Erickson. 1995. Lower Bounds for Linear Satisfiability Problems. In SODA. 388--395. https:\/\/dl.acm.org\/doi\/10.5555\/313651.313772  Jeff Erickson. 1995. Lower Bounds for Linear Satisfiability Problems. In SODA. 388--395. https:\/\/dl.acm.org\/doi\/10.5555\/313651.313772"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/360680.360691"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1030"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213002"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925--7721(95)00022--2"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735494"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/C2013-0--10739--8"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02127798"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207013"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.80"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90123--1"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3003665.3003667"},{"key":"e_1_3_2_2_28_1","unstructured":"Dan Olteanu and Jakub Zavodny. 2012. Factorised representations of query results: size bounds and readability. In ICDT. 285--298. https:\/\/doi.org\/10.1145\/ 2274576.2274607  Dan Olteanu and Jakub Zavodny. 2012. Factorised representations of query results: size bounds and readability. In ICDT. 285--298. https:\/\/doi.org\/10.1145\/ 2274576.2274607"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806772"},{"key":"e_1_3_2_2_30_1","volume-title":"Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries. CoRR abs\/1911.05582","author":"Tziavelis Nikolaos","year":"2019","unstructured":"Nikolaos Tziavelis , Deepak Ajwani , Wolfgang Gatterbauer , Mirek Riedewald , and Xiaofeng Yang . 2019. Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries. CoRR abs\/1911.05582 ( 2019 ). https:\/\/arxiv.org\/abs\/ 1911.05582 Nikolaos Tziavelis, Deepak Ajwani,Wolfgang Gatterbauer, Mirek Riedewald, and Xiaofeng Yang. 2019. Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries. CoRR abs\/1911.05582 (2019). https:\/\/arxiv.org\/abs\/ 1911.05582"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397250"},{"key":"e_1_3_2_2_32_1","volume-title":"Optimal Join Algorithms Meet Top-k. In SIGMOD. 2659--2665","author":"Tziavelis Nikolaos","year":"2020","unstructured":"Nikolaos Tziavelis , Wolfgang Gatterbauer , and Mirek Riedewald . 2020 . Optimal Join Algorithms Meet Top-k. In SIGMOD. 2659--2665 . https:\/\/doi.org\/10.1145\/ 3318464.3383132 Nikolaos Tziavelis, Wolfgang Gatterbauer, and Mirek Riedewald. 2020. Optimal Join Algorithms Meet Top-k. In SIGMOD. 2659--2665. https:\/\/doi.org\/10.1145\/ 3318464.3383132"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.IPEC.2015.17"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3214708.3214711"},{"key":"e_1_3_2_2_35_1","unstructured":"Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In VLDB. 82--94. https:\/\/dl.acm.org\/doi\/10.5555\/1286831.1286840  Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In VLDB. 82--94. https:\/\/dl.acm.org\/doi\/10.5555\/1286831.1286840"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Virtual Event China","acronym":"SIGMOD\/PODS '21"},"container-title":["Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452021.3458331","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3452021.3458331","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452021.3458331","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452021.3458331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:07Z","timestamp":1750193287000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452021.3458331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,20]]},"references-count":33,"alternative-id":["10.1145\/3452021.3458331","10.1145\/3452021"],"URL":"https:\/\/doi.org\/10.1145\/3452021.3458331","relation":{},"subject":[],"published":{"date-parts":[[2021,6,20]]},"assertion":[{"value":"2021-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}