ICDT Accepted Papers

 Covers and Domain Orderings for Beyond Worst-Case Join Processing

Kaleb Alway (SAP SE, Canada), Eric Blais (University of Waterloo, Canada), and Semih Salihoglu (University of Waterloo, Canada)

A Purely Regular Approach to Non-Regular Core Spanners

Markus L. Schmid (Humboldt Universität Berlin, Germany) and Nicole Schweikardt (Humboldt Universität Berlin, Germany)

Ranked Enumeration of Conjunctive Query Results

Shaleen Deep (University of Wisconsin-Madison, United States) and Paraschos Koutris (University of Wisconsin-Madison, United States)

Towards Optimal Dynamic Indexes for Approximate (and Exact) Triangle Counting

Shangqi Lu (The Chinese University of Hong Kong, Hong Kong) and Yufei Tao (The Chinese University of Hong Kong, Hong Kong)

Grammars for Document Spanners

Liat Peterfreund (IRIF – CNRS, Université de Paris, France)

Input-Output Disjointness for Forward Expressions in the Logic of Information Flows

Heba Aamer (Universiteit Hasselt, Belgium) and Jan Van den Bussche( Universiteit Hasselt, Belgium)

Conjunctive Queries: Unique Characterizations and Exact Learnability

Balder ten Cate (Google, United States) and Victor Dalmau (University Pompeu Fabra, Spain)

The Complexity of Aggregates over Extractions by Regular Expressions

Johannes Doleschal (Universität Bayreuth & Hasselt University, Germany), Noa Bratman (Technion, Israel), Benny Kimelfeld (Technion, Israel), and Wim Martens (University of Bayreuth, Germany)

Answer Counting under Guarded TGDs

Cristina Feier (University of Bremen, Germany), Carsten Lutz (University of Bremen, Germany), and Marcin Przybylko (University of Bremen, Germany)

Maximum Coverage in the Data Stream Model: Parameterized and Generalized

Andrew McGregor (University of Massachusetts, Amherst, United States), David Tench (Stony Brook University, United States), and Hoa Vu (San Diego State University, United States)

Diverse Data Selection under Fairness Constraints

Zafeiria Moumoulidou (University of Massachusetts, Amherst, United States), Andrew McGregor (University of Massachusetts, Amherst, United States), and Alexandra Meliou (University of Massachusetts, Amherst, United States)

Enumeration Algorithms for Conjunctive Queries with Projection

Shaleen Deep (University of Wisconsin-Madison, United States), Xiao Hu (Duke University, United States), and Paraschos Koutris (University of Wisconsin-Madison, United States)

The Shapley Value of Inconsistency Measures for Functional Dependencies

Ester Livshits (Technion, Israel) and Benny Kimelfeld (Technion, Israel)

Database Repairing with Soft Functional Dependencies

Nofar Carmeli (Technion, Israel), Martin Grohe (RWTH Aachen University, Germany), Benny Kimelfeld (Technion, Israel), Ester Livshits (Technion, Israel), and Muhammad Tibi (Technion, Israel)

Uniform Reliability of Self-Join-Free Conjunctive Queries

Antoine Amarilli (LTCI, Télécom Paris, Institut polytechnique de Paris, France) and Benny Kimelfeld (Technion, Israel)

Efficient Differentially Private F0 Linear Sketching

Rasmus Pagh (IT University of Copenhagen, Denmark) and Nina Mesing Stausholm (IT University of Copenhagen, Denmark)

Fine-Grained Complexity of Regular Path Queries

Katrin Casel (Hasso-Plattner-Institute, University Potsdam, Germany) and Markus L. Schmid (Humboldt Universität Berlin, Germany)

Ranked enumeration of MSO logic on words

Pierre Bourhis (CNRS Lille, France), Alejandro Grez (PUC & IMFD, Chile), Louis Jachiet (LTCI, IP Paris, France), and Cristian Riveros (PUC & IMFD, Chile)

Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing

Samuel McCauley (Williams College, United States)

Locality-aware Distribution Schemes

Bruhathi Sundarmurthy (University of Wisconsin-Madison, United States), Paraschos Koutris (University of Wisconsin-Madison, United States), and Jeffrey Naughton (University of Wisconsin-Madison, United States)