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 starting from reproduced papers of SIGMOD 2020.

To access all reproduced papers please click here.

ACM SIGMOD 2023 Badges and Reproducibility Results

Paper Title Report Badges Awarded
Polaris: Enabling Transaction Priority in Optimistic Concurrency Control
SafeBound: A Practical System for Generating Cardinality Bounds
Efficient Star-based Truss Maintenance on Dynamic Graphs
Efficient GPU-Accelerated Subgraph Matching
T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery
GIO: Generating Efficient Matrix and Frame Readers for Custom Data Formats by Example
AWARE: Workload-aware, Redundancy-exploiting Linear Algebra
iFlipper: Label Flipping for Individual Fairness
ML2DAC: Meta-learning to Democratize AutoML for Clustering Analysis
LightCTS: A Lightweight Framework for Correlated Time Series Forecasting
DeltaBoost: Gradient Boosting Decision Trees with Efficient Machine Unlearning
Honorable Mention for Best Artifact
A Universal Question-Answering Platform for Knowledge Graphs
InfiniFilter: Expanding Filters to Infinity and Beyond
Best Artifact
EAR-Oracle: On Efficient Indexing for Distance Queries between Arbitrary Points on Terrain Surface
Efficiently Computing Join Orders with Heuristic Search
Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware
A Step Toward Deep Online Aggregation
Honorable Mention for Best Artifact
High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
MRVs: Enforcing Numeric Invariants in Parallel Updates to Hotspots with Randomized Splitting
Using Cloud Functions as Accelerator for Elastic Data Analytics
Parallel Strong Connectivity Based on Faster Reachability
INEv: In-Network Evaluation for Event Stream Processing
Discovering Similarity Inclusion Dependencies
DAMR: Dynamic Adjacency Matrix Representation Learning for Multivariate Time Series Imputation
Learned Data-aware Image Representations of Line Charts for Similarity Search
Scapin: Scalable Graph Structure Perturbation by Augmented Influence Maximization
ForestTI: A Scalable Inverted-Index-Oriented Timeseries Management System with Flexible Memory Efficiency
FactorJoin: A New Cardinality Estimation Framework for Join Queries
Detock: High Performance Multi-region Transactions at Scale
Most Expected Winner: An Interpretation of Winners over Uncertain Voter Preferences
Dumpy: A Compact and Adaptive Index for Large Data Series Collections
ST4ML: Machine Learning Oriented Spatio-Temporal Data Processing at Scale
Generalizing Bulk-Synchronous Parallel Processing for Data Science: From Data to Threads and Agent-Based Simulations
Pea Hash: A Performant Extendible Adaptive Hashing Index
Prerequisite-driven Fair Clustering on Heterogeneous Information Networks
On Querying Connected Components in Large Temporal Graphs
Efficient and Effective Attributed Hypergraph Clustering via 𝐾-Nearest Neighbor Augmentation
LightTS: Lightweight Time Series Classification with Adaptive Ensemble Distillation
How To Optimize My Blockchain? A Multi-Level Recommendation Approach
dsJSON: A Distributed SQL JSON Processor
When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories
CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression
Query-Guided Resolution in Uncertain Databases
LightRW: FPGA Accelerated Graph Dynamic Random Walks
Exploiting Structure in Regular Expression Queries
Grep: A Graph Learning Based Database Partitioning System
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach

ACM SIGMOD 2022 Badges and Reproducibility Results

Paper Title Report Badges Awarded
JEDI: These aren't the JSON documents you're looking for ...
Best Artifact
CoLES: Contrastive Learning for Event Sequences with Self-Supervision
Where Is My Training Bottleneck? Hidden Trade-Offs in Deep Learning Preprocessing Pipelines
AutoMon: Automatic Distributed Monitoring for Arbitrary Multivariate Functions
Conjunctive Queries with Comparisons
WeTune: Automatic Discovery and Verification of Query Rewrite Rules
Hybrid Deterministic and Nondeterministic Execution of Transactions in Actor Systems
Controlled Intentional Degradation in Analytical Video Systems
Cooperative Route Planning Framework for Multiple Distributed Assets in Maritime Applications
Explaining Link Prediction Systems based on Knowledge Graph Embeddings
dCAM: Dimension-wise Class Activation Map for Explaining Multivariate Data Series Classification
HypeR: Hypothetical Reasoning With What-If and How-To Queries Using a Probabilistic Causal Approach
Honorable Mention for Best Artifact
DataPrism: Exposing Disconnect between Data and Systems
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams
Rank Aggregation with Proportionate Fairness
Givens QR Decomposition over Relational Databases
TASTI: Semantic Indexes for Machine Learning-based Queries over Unstructured Data
Finding Label and Model Errors in Perception Data With Learned Observation Assertions
Secure and Policy-Compliant Query Processing on Heterogeneous Computational Storage Architecture
Interpretable Data-Based Explanations for Fairness Debugging
Efficient Algorithms for Maximal k-Biplex Enumeration
Efficient Massively Parallel Join Optimization for Large Queries
Redundancy Elimination in Distributed Matrix Computation
Efficient Answering of Historical What-if Queries
HET-GMP: a Graph-based System Approach to Scaling Large Embedding Model Training
SAM: Database Generation from Query Workload with Supervised Autoregressive Model
CompactWalks: Taming Knowledge-Graph Embeddings With Domain- and Task-Specific Pathways

ACM SIGMOD 2021 Badges and Reproducibility Results

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
Best Artifact
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
HADAD: A Lightweight Approach for Optimizing Hybrid Complex Analytics Queries
Efficient Exploration of Interesting Aggregates in RDF Graphs
AlphaEvolve: A Learning Framework to Discover Novel Alphas in Quantitative Investment

ACM SIGMOD 2020 Badges and Reproducibility Results

Paper Title Report Badges Awarded
QueryVis: Logic-based Diagrams help Users Understand Complicated SQL Queries Faster
Best Artifact
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
Best Artifact
Functional-Style SQL UDFs With a Capital 'F'
Best Artifact
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