{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:55Z","timestamp":1763468035241,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,12]],"date-time":"2011-06-12T00:00:00Z","timestamp":1307836800000},"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":[[2011,6,12]]},"DOI":"10.1145\/1989323.1989393","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"661-672","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["More efficient datalog queries"],"prefix":"10.1145","author":[{"given":"K. Tuncay","family":"Tekle","sequence":"first","affiliation":[{"name":"LogicBlox, Atlanta, GA, USA"}]},{"given":"Yanhong A.","family":"Liu","sequence":"additional","affiliation":[{"name":"State University of New York at Stony Brook, Stony Brook, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,12]]},"reference":[{"volume-title":"Addison-Wesley","year":"1995","author":"Abiteboul S.","key":"e_1_3_2_1_1_1"},{"volume-title":"University of Copenhagen","year":"1994","author":"Andersen L. O.","key":"e_1_3_2_1_2_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1016\/0743-1066(91)90038-Q"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1016\/0169-023X(90)90017-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.5555\/83229"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/227595.227597"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/62212.62259"},{"issue":"7","key":"e_1_3_2_1_8_1","first-page":"764","article-title":"da Silva and V. S. Costa. The design of the YAP compiler: An optimizing compiler for logic programming languages","volume":"12","author":"A.","year":"2006","journal-title":"J. of Universal Computer Science"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.5555\/829514.830540"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1007\/11785477_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/378795.378802"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1016\/0022-0000(91)90033-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/212433.220207"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.5555\/645773.667961"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1526709.1526790"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/1552309.1552311"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1592761.1592785"},{"key":"e_1_3_2_1_18_1","first-page":"140","volume-title":"Proc. of the 5th Intl. Conf. and Symp. on Logic Programming","author":"Ramakrishnan R.","year":"1988"},{"key":"e_1_3_2_1_19_1","first-page":"321","volume-title":"Proc. of the 1991 Intl. Symp. on Logic Programming (ISLP)","author":"Ramakrishnan R.","year":"1991"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1016\/0743-1066(94)00039-9"},{"key":"e_1_3_2_1_21_1","first-page":"112","volume-title":"Proc. of the 1996 Joint Intl. Conf. and Symp. on Logic Programming","author":"Rao P.","year":"1996"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.5555\/61352.61369"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/1376616.1376673"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.5555\/1325851.1325968"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.5555\/645520.655970"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/1836089.1836093"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/1836089.1836094"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/73721.73736"},{"unstructured":"D. S. Warren. Programming in tabled Prolog. Available at \\\\http:\/\/www.cs.sunysb.edu\/~warren\/xsbbook\/ 1999.  D. S. Warren. Programming in tabled Prolog. Available at \\\\http:\/\/www.cs.sunysb.edu\/~warren\/xsbbook\/ 1999.","key":"e_1_3_2_1_29_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1007\/11575467_8"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"acronym":"SIGMOD\/PODS '11","name":"SIGMOD\/PODS '11: International Conference on Management of Data","location":"Athens Greece"},"container-title":["Proceedings of the 2011 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989393","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989323.1989393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:21Z","timestamp":1750245741000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989393"}},"subtitle":["subsumptive tabling beats magic sets"],"short-title":[],"issued":{"date-parts":[[2011,6,12]]},"references-count":30,"alternative-id":["10.1145\/1989323.1989393","10.1145\/1989323"],"URL":"https:\/\/doi.org\/10.1145\/1989323.1989393","relation":{},"subject":[],"published":{"date-parts":[[2011,6,12]]},"assertion":[{"value":"2011-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}