circle-symbol
  • Home
  • Process
  • Guidelines
  • Committee
  • Awards
  • History
  • Reports
  • Reproduced Papers

Badges and Reproducibility Reports

The reviewers submit their reports, which are published in this page. Following is the list of papers that passed the reproducibility test, the functionality test, and/or have made their artifacts available, along with the reproducibility reports (when applicable) and the badges awarded. The reproducibility reports are maintained here since SIGMOD 2021 Reproducibility.

To access all reproduced papers please click here.


SIGMOD 2022 Reproducibility

Reproducing papers presented at ACM SIGMOD 2021
Paper Title Report Badges Awarded
Parallelizing Intra-Window Join on Multicores: An Experimental Study
REDS: Rule Extraction for Discovering Scenarios
At-the-time and Back-in-time Persistent Sketches
LIMA: Fine-grained Lineage Tracing and Reuse in Machine Learning Systems
One WITH RECURSIVE is Worth Many GOTOs
Conformance Constraint Discovery: Measuring Trust in Data-Driven Systems
ExDRa: Exploratory Data Science on Federated Raw Data
MxTasks: How to Make Efficient Synchronization and Prefetching Easy
Efficient Graph Summarization using Weighted LSH at Billion-Scale
Putting Things into Context: Rich Explanations for Query Answers using Join Graphs
TreeToaster: Towards an IVM-Optimized Compiler
EIRES: Efficient Integration of Remote Data in Event Stream Processing
SliceLine: Fast, Linear-Algebra-based Slice Finding for ML Model Debugging
Adaptive Compression for Fast Scans on String Columns
Tuplex: Data Science in Python at Native Code Speed
Looking for Trouble: Analyzing Classifier Behavior via Pattern Divergence
Parallel Index-based Structural Graph Clustering and its Approximation
Efficient Uncertainty Tracking for Complex Queries with Attribute-level Bounds
COMPASS: Online Sketch-based Query Optimization for In-Memory Databases
Clonos: Consistent Causal Recovery for Highly-Available Streaming Dataflows
Maximizing Persistent Memory Bandwidth Utilization for OLAP Workloads
Explaining Black-Box Algorithms Using Probabilistic Contrastive Counterfactuals
Efficient Exploration of Interesting Aggregates in RDF Graphs
HADAD: A Lightweight Approach for Optimizing Hybrid Complex Analytics Queries
AlphaEvolve: A Learning Framework to Discover Novel Alphas in Quantitative Investment

SIGMOD 2021 Reproducibility

Reproducing papers presented at ACM SIGMOD 2020
Paper Title Report Badges Awarded
QueryVis: Logic-based Diagrams help Users Understand Complicated SQL Queries Faster
Creating Embeddings of Heterogeneous Relational Datasets for Data Integration Tasks
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs
Realistic Re-evaluation of Knowledge Graph Completion Methods: An Experimental Study
Factorized Graph Representations for Semi-Supervised Learning from Sparse Data
Functional-Style SQL UDFs With a Capital 'F'
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring
BugDoc: Algorithms to Debug Computational Processes
Database Benchmarking for Supporting Real-Time Interactive Querying of Large Data
Automating Incremental and Asynchronous Evaluation for Recursive Aggregate Data Processing
Pump Up the Volume: Processing Large Data on GPUs with Fast Interconnects
LISA: A Learned Index Structure for Spatial Data
Timely Reporting of Heavy Hitters using External Memory
Theoretically-Efficient and Practical Parallel DBSCAN
Towards Interpretable and Learnable Risk Analysis for Entity Resolution
BinDex: A Two-Layered Index for Fast and Robust Scans





Copyright © ACM SIGMOD. All Rights Reserved.