SIGMOD Santiago, Chile, 2024

PODS 2024: Accepted Papers

  • Join Size Bounds using Lp Norms on Degree Sequences
    Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu and Dan Suciu
  • TypeQL: A Type-Theoretic & Polymorphic Query Language
    Christoph Dorn and Haikal Pribadi
  • Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization
    Hangdong Zhao, Austen Z. Fan, Xiating Ouyang and Paraschos Koutris
  • Consistency of Relations over Monoids
    Albert Atserias and Phokion Kolaitis
  • Topology-aware Parallel Joins
    Xiao Hu and Paraschos Koutris
  • Bag Semantics Conjunctive Query Containment. Four Small Steps Towards Undecidability.
    Jerzy Marcinkowski and Mateusz Orda
  • Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald
    Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu and Huacheng Yu
  • Distinct Shortest Walk Enumeration for RPQs
    Claire David, Nadime Francis and Victor Marsault
  • The Weisfeiler-Leman Dimension of Existential Conjunctive Queries
    Andreas Göbel, Leslie Ann Goldberg and Marc Roth
  • Containment of Graph Queries Modulo Schema
    Victor Gutierrez-Basulto, Albert Gutowski, Yazmin A. Ibanez-Garcia and Filip Murlak
  • A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join
    Anantha Padmanabha, Luc Segoufin and Cristina Sirangelo
  • Tight Bounds of Circuits for Sum-Product Queries
    Austen Z. Fan, Paraschos Koutris and Hangdong Zhao
  • On Density-based Local Community Search
    Miao Qiao, Yizhou Dai and Ronghua Li
  • Verification of Unary Communicating Datalog Programs
    C. Aiswarya, Diego Calvanese, Francesco Di Cosmo and Marco Montali
  • Evaluating Datalog over Semirings: A Grounding-based Approach
    Hangdong Zhao, Shaleen Deep, Paraschos Koutris, Sudeepa Roy and Val Tannen
  • When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control
    Brecht Vandevoort, Bas Ketsman and Frank Neven
  • Expected Shapley-Like Scores of Boolean functions: Complexity and Applications to Probabilistic Databases
    Pratik Karmakar, Mikael Monet, Pierre Senellart and Stephane Bressan
  • On Reporting Durable Patterns in Temporal Proximity Graphs
    Pankaj Agarwal, Xiao Hu, Stavros Sintos and Jun Yang
  • Streaming Algorithms with Few State Changes
    Rajesh Jayaram, David P. Woodruff and Samson Zhou
  • Chase Termination Beyond Polynomial Time
    Philipp Hanisch and Markus Krötzsch
  • Continual Release of Differentially Private Synthetic Data from Longitudinal Data Collections
    Mark Bun, Marco Gaboardi, Marcel Neunhoeffer and Wanrong Zhang
  • Provenance postulates: Instance-based provenance for first-order logic
    Bart Bogaerts, Maxime Jakubowski and Jan Van den Bussche
  • Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC
    Sam M. Thompson and Dominik D. Freydenberger
  • Enumeration for MSO-Queries on Compressed Trees
    Markus Lohrey and Markus L. Schmid
  • From Shapley Value to Model Counting and Back
    Ahmet Kara, Dan Olteanu and Dan Suciu
  • Fast Matrix Multiplication for Query Processing
    Xiao Hu
  • Combined Approximations for Uniform Operational Consistent Query Answering
    Marco Calautti, Ester Livshits, Andreas Pieris and Markus Schneider
  • Consistent Query Answering for Primary Keys on Rooted Tree Queries
    Paraschos Koutris, Xiating Ouyang and Jef Wijsen
  • Layered List Labeling
    Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlos and William Kuszmaul
  • Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
    Yu Cheng, Max Li, Honghao Lin, Zi-Yi Tai, David Woodruff and Jason Zhang
  • On the Feasibility of Forgetting in Data Streams
    Sourav Chakraborty, Kuldeep Meel, A Pavan and N. V. Vinodchandran
  • Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries
    Neha Makhija and Wolfgang Gatterbauer
  • The Moments Method for Approximate Data Cube Queries
    Peter Lindner, Dan Suciu, Christoph Koch and Sachin Basil John
  • Query Optimization by Quantifier Elimination
    Christoph Koch and Peter Lindner
  • History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures
    Michael A. Bender, Martin Farach-Colton, Michael T. Goodrich and Hanna Komlos
  • The Complexity of Why-Provenance for Datalog Queries
    Marco Calautti, Ester Livshits, Andreas Pieris and Markus Schneider
  • A faster FPRAS for #NFA
    Sourav Chakraborty, Umang Mathur and Kuldeep Meel
  • Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
    Jacob Focke, Leslie Ann Goldberg, Marc Roth and Stanislav Zivny
  • When is Shapley Value Computation a Matter of Counting?
    Meghyn Bienvenu, Diego Figueira and Pierre Lafourcade

Follow our progress: FacebookTwitter