{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:12:49Z","timestamp":1778497969661,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0905276, IIS-1217869"],"award-info":[{"award-number":["IIS-0905276, IIS-1217869"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2452376.2452439","type":"proceedings-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T14:14:26Z","timestamp":1364220866000},"page":"537-548","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Data exchange with arithmetic operations"],"prefix":"10.1145","author":[{"given":"Balder","family":"ten Cate","sequence":"first","affiliation":[{"name":"UC Santa Cruz"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phokion G.","family":"Kolaitis","sequence":"additional","affiliation":[{"name":"UC Santa Cruz & IBM Research - Almaden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walied","family":"Othman","sequence":"additional","affiliation":[{"name":"University of Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275516"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353403"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989338"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2006.30"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1941440"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1632"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646235.682563"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808712"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574701"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62257"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80004-X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-012-0216-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85521-7_4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1O16\/j.tcs.2004.10.033"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204006"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189769.1189778"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to parallel computation: P-completeness theory","author":"Greenlaw R.","year":"1995","unstructured":"R. Greenlaw , H. Hoover , and W. Ruzzo . Limits to parallel computation: P-completeness theory . Oxford University Press , 1995 . R. Greenlaw, H. Hoover, and W. Ruzzo. Limits to parallel computation: P-completeness theory. Oxford University Press, 1995."},{"key":"e_1_3_2_1_18_1","volume-title":"Sur la complexit\u00e9 du principe de Tarski-Seidenberg. Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France, tome 118(1):101--126","author":"Heintz J.","year":"1990","unstructured":"J. Heintz , M.-F. Roy , and P. Solern\u00f3 . Sur la complexit\u00e9 du principe de Tarski-Seidenberg. Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France, tome 118(1):101--126 , 1990 . J. Heintz, M.-F. Roy, and P. Solern\u00f3. Sur la complexit\u00e9 du principe de Tarski-Seidenberg. Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France, tome 118(1):101--126, 1990."},{"key":"e_1_3_2_1_19_1","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachiyan L.","year":"1979","unstructured":"L. Khachiyan . A polynomial algorithm in linear programming . Soviet Mathematics Doklady , 20 : 191 -- 194 , 1979 . L. Khachiyan. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20:191--194, 1979.","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065176"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.03.001"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00193-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/237661.237693"},{"key":"e_1_3_2_1_24_1","unstructured":"The rectilinear crossing number project. http:\/\/www.ist.tugraz.at\/staff\/aichholzer\/research\/rp\/triangulations\/crossing\/. Accessed 10\/17\/2012.  The rectilinear crossing number project. http:\/\/www.ist.tugraz.at\/staff\/aichholzer\/research\/rp\/triangulations\/crossing\/. Accessed 10\/17\/2012."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(10)80003-3"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.2307\/2266510"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11805-0_32"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"Tarski A.","year":"1951","unstructured":"A. Tarski . A Decision Method for Elementary Algebra and Geometry . University of California Press , 1951 . A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687741"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/648314.755832"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80003-8"},{"key":"e_1_3_2_1_32_1","unstructured":"Wolfram MathWorld. Rectilinear crossing problem. http:\/\/mathworld.wolfram.com\/RectilinearCrossingNumber.html. Accessed 10\/17\/2012.  Wolfram MathWorld. Rectilinear crossing problem. http:\/\/mathworld.wolfram.com\/RectilinearCrossingNumber.html. Accessed 10\/17\/2012."}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","location":"Genoa Italy","acronym":"EDBT\/ICDT '13"},"container-title":["Proceedings of the 16th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2452376.2452439","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2452376.2452439","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:25Z","timestamp":1750234705000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2452376.2452439"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":32,"alternative-id":["10.1145\/2452376.2452439","10.1145\/2452376"],"URL":"https:\/\/doi.org\/10.1145\/2452376.2452439","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}