This award recognizes the best papers in terms of reproducibility. The three most reproducible papers are picked every year and the awards are presented during the awards session of the SIGMOD conference (next year). Each award comes with a 750$ honorarium sponsored by IBM.
The criteria are as follows: (i) coverage (ideal: all results can be verified), (ii) ease of reproducibility (ideal: just works), (iii) flexibility (ideal: can change workloads, queries, data and get similar behavior with published results), and (iv) portability (ideal: linux, mac, windows).
Winners of 2017
Awarded to Most Reproducible Papers of ACM SIGMOD 2016.
Generating Preview Tables for Entity Graphs
by Ning Yan, Sona Hasani, Abolfazl Asudeh, Chengkai Li
Verified by: Hideaki Kimura
SQLShare: Results from a Multi-Year SQL-as-a-Service Experiment
by Shrainik Jain, Dominik Moritz, Daniel Halperin, Bill Howe, Ed Lazowska
Verified by: Juliana Freire, Fernando Seabra Chirigati, Tuan-Anh Hoang-Vu
Data Polygamy: The Many-Many Relationships among Urban Spatio-Temporal Data Sets
by Fernando Chirigati, Harish Doraiswamy, Theodoros Damoulas, Juliana Freire
Verified by: Azza Abouzied