{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:36Z","timestamp":1750308756118,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"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":[[2007,6,11]]},"DOI":"10.1145\/1265530.1265572","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"303-312","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Maximally joining probabilistic data"],"prefix":"10.1145","author":[{"given":"Benny","family":"Kimelfeld","sequence":"first","affiliation":[{"name":"The Hebrew University of Jerusalem"}]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[{"name":"The Hebrew University of Jerusalem"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.166990"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322389"},{"issue":"4","key":"e_1_3_2_1_3_1","volume":"10","author":"Bernstein P. A.","year":"1981","unstructured":"P. A. Bernstein and N. Goodman . Power of natural semijoins. SIAM J. Comput. , 10 ( 4 ), 1981 . P. A. Bernstein and N. Goodman. Power of natural semijoins. SIAM J. Comput., 10(4), 1981.","journal-title":"Power of natural semijoins. SIAM J. Comput."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645914.671645"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164191"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065180"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.015"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_20"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316764"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/232753.232796"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322390"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/239041.239045"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191908"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"issue":"3","key":"e_1_3_2_1_16_1","volume":"64","author":"Kanza Y.","year":"2002","unstructured":"Y. Kanza , W. Nutt , and Y. Sagiv . Querying incomplete information in semistructured data. J. Comput. Syst. Sci. , 64 ( 3 ), 2002 . Y. Kanza, W. Nutt, and Y. Sagiv. Querying incomplete information in semistructured data. J. Comput. Syst. Sci., 64(3), 2002.","journal-title":"Querying incomplete information in semistructured data. J. Comput. Syst. Sci."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773162"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/261124.261131"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/322307.322311"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287425"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/237661.237717"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221023"},{"key":"e_1_3_2_1_24_1","first-page":"8","author":"Valiant L. G.","year":"1979","unstructured":"L. G. Valiant . The complexity of computing the permanent. Theor. Comput. Sci. , 8 , 1979 . L. G. Valiant. The complexity of computing the permanent. Theor. Comput. Sci., 8, 1979.","journal-title":"Theor. Comput. Sci."},{"key":"e_1_3_2_1_25_1","volume-title":"VLDB","author":"Yannakakis M.","year":"1981","unstructured":"M. Yannakakis . Algorithms for acyclic database schemes . In VLDB , 1981 . M. Yannakakis. Algorithms for acyclic database schemes. In VLDB, 1981."}],"event":{"name":"SIGMOD\/PODS07: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Beijing China","acronym":"SIGMOD\/PODS07"},"container-title":["Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1265530.1265572","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1265530.1265572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:24Z","timestamp":1750278144000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1265530.1265572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":25,"alternative-id":["10.1145\/1265530.1265572","10.1145\/1265530"],"URL":"https:\/\/doi.org\/10.1145\/1265530.1265572","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}