{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:43Z","timestamp":1750221103443,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3294052.3319688","type":"proceedings-article","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T12:56:45Z","timestamp":1560776205000},"page":"270-284","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["The Space-Efficient Core of Vadalog"],"prefix":"10.1145","author":[{"given":"Gerald","family":"Berger","sequence":"first","affiliation":[{"name":"TU Wien, Vienna, Austria"}]},{"given":"Georg","family":"Gottlob","sequence":"additional","affiliation":[{"name":"University of Oxford & TU Wien, Oxford, United Kingdom"}]},{"given":"Andreas","family":"Pieris","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, United Kingdom"}]},{"given":"Emanuel","family":"Sallinger","sequence":"additional","affiliation":[{"name":"University of Oxford & TU Wien, Oxford, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00730-2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594555"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3238304"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850586"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646235.682563"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3171642.3171643"},{"key":"e_1_3_2_1_7_1","first-page":"975","article-title":"The Vadalog System","volume":"11","author":"Bellomarini Luigi","year":"2018","unstructured":"Luigi Bellomarini , Emanuel Sallinger , and Georg Gottlob . 2018 . The Vadalog System : Datalog-based Reasoning for Knowledge Graphs. PVLDB , Vol. 11 , 9 (2018), 975 -- 987 . Luigi Bellomarini, Emanuel Sallinger, and Georg Gottlob. 2018. The Vadalog System: Datalog-based Reasoning for Knowledge Graphs. PVLDB, Vol. 11, 9 (2018), 975--987.","journal-title":"Datalog-based Reasoning for Knowledge Graphs. PVLDB"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Michael Benedikt George Konstantinidis Giansalvatore Mecca Boris Motik Paolo Papotti Donatello Santoro and Efthymia Tsamoura. 2017. Benchmarking the Chase. In PODS. 37--52.  Michael Benedikt George Konstantinidis Giansalvatore Mecca Boris Motik Paolo Papotti Donatello Santoro and Efthymia Tsamoura. 2017. Benchmarking the Chase. In PODS. 37--52.","DOI":"10.1145\/3034786.3034796"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Peter Van Emde Boas. 1997. The Convenience of Tilings. In Complexity Logic and Recursion Theory . 331--363.  Peter Van Emde Boas. 1997. The Convenience of Tilings. In Complexity Logic and Recursion Theory . 331--363.","DOI":"10.1201\/9780429187490-12"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591248.2591252"},{"key":"e_1_3_2_1_11_1","volume-title":"Thomas Lukasiewicz, Bruno Marnette, and Andreas Pieris.","author":"Cal Andrea","year":"2010","unstructured":"Andrea Cal ` i, Georg Gottlob , Thomas Lukasiewicz, Bruno Marnette, and Andreas Pieris. 2010 . Datalog Andrea Cal`i, Georg Gottlob, Thomas Lukasiewicz, Bruno Marnette, and Andreas Pieris. 2010. Datalog"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.27"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.08.002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_13"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1085304.1085309"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2638546"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832581.2832668"},{"key":"e_1_3_2_1_19_1","unstructured":"Ruoming Jin Yang Xiang Ning Ruan and Haixun Wang. 2008. Efficiently answering reachability queries on very large directed graphs. In SIGMOD . 595--608.  Ruoming Jin Yang Xiang Ning Ruan and Haixun Wang. 2008. Efficiently answering reachability queries on very large directed graphs. In SIGMOD . 595--608."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90081-3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796487"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.3233\/SW-140153"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11964-9_35"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320115"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/6012.15420"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/28659.28684"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1520"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19"},"container-title":["Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3294052.3319688","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3294052.3319688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:01:47Z","timestamp":1750208507000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3294052.3319688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":27,"alternative-id":["10.1145\/3294052.3319688","10.1145\/3294052"],"URL":"https:\/\/doi.org\/10.1145\/3294052.3319688","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}