{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:13Z","timestamp":1750220713834,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T00:00:00Z","timestamp":1576713600000},"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":["SIGMOD Rec."],"published-print":{"date-parts":[[2019,12,19]]},"abstract":"<jats:p>While organizing the submission evaluation process for the SIGMOD 2019 research track, we aim at maximizing the value of the reviews while minimizing the probability of misunderstandings due to factual errors, thereby valorizing impactful ideas. The objective is an educating and rewarding experience for both the authors and the reviewers. The actionable goals are: 1. Maximize review depth and breadth. For depth, optimizing the assignment of papers to reviewers is of key importance; \"low confidence\" reviews should be few to none, in order for reviewers to provide extensive and useful comments to the authors. To cover the breadth and to address controversial issues, recruit as many reviewers as needed to converge to a unanimous set of comments. 2. Ensure that all submissions are treated equally fairly by experts in the respective domains. 3. Obtain as much input from the authors as possible during the process. Enabling author feedback is the key step in the process. 4. Allow re-evaluation of papers with non-critical flaws through revisions.<\/jats:p>","DOI":"10.1145\/3377330.3377340","type":"journal-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T13:33:12Z","timestamp":1576848792000},"page":"47-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The SIGMOD 2019 Research Track Reviewing System"],"prefix":"10.1145","volume":"48","author":[{"given":"Anastasia","family":"Ailamaki","sequence":"first","affiliation":[{"name":"EPFL &amp; RAW Labs SA, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Periklis","family":"Chrysogelos","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amol","family":"Deshpande","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Kraska","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,12,19]]},"reference":[{"unstructured":"Aminer. https:\/\/aminer.org\/.  Aminer. https:\/\/aminer.org\/.","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","author":"Blei D. M.","year":"2003","unstructured":"D. M. Blei , A. Y. Ng , and M. I. Jordan . Latent dirichlet allocation. Journal of machine Learning research, 3(Jan):993--1022 , 2003 . D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. Journal of machine Learning research, 3(Jan):993--1022, 2003.","journal-title":"Journal of machine Learning research, 3(Jan):993--1022"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 30th International Conference on Machine Learning","author":"Charlin L.","year":"2013","unstructured":"L. Charlin and R. Zemel . The toronto paper matching system: an automated paper-reviewer assignment system . Proceedings of the 30th International Conference on Machine Learning , 2013 . L. Charlin and R. Zemel. The toronto paper matching system: an automated paper-reviewer assignment system. Proceedings of the 30th International Conference on Machine Learning, 2013."},{"unstructured":"Conference management toolkit. https:\/\/cmt3.research.microsoft.com.  Conference management toolkit. https:\/\/cmt3.research.microsoft.com.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","volume-title":"Cvx: Matlab software for disciplined convex programming","author":"Grant M.","year":"2014","unstructured":"M. Grant and S. Boyd . Cvx: Matlab software for disciplined convex programming , 2014 . M. Grant and S. Boyd. Cvx: Matlab software for disciplined convex programming, 2014."},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1109\/ICDE.2018.00012"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377330.3377340","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377330.3377340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:17Z","timestamp":1750199597000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377330.3377340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,19]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,12,19]]}},"alternative-id":["10.1145\/3377330.3377340"],"URL":"https:\/\/doi.org\/10.1145\/3377330.3377340","relation":{},"ISSN":["0163-5808"],"issn-type":[{"type":"print","value":"0163-5808"}],"subject":[],"published":{"date-parts":[[2019,12,19]]},"assertion":[{"value":"2019-12-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}