


default search action
ACM Transactions on Database Systems, Volume 49
Volume 49, Number 1, March 2024
- Georg Gottlob
, Matthias Lanzinger
, Cem Okulmus
, Reinhard Pichler
:
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. 1:1-1:43 - Wenfei Fan
, Ping Lu
, Kehan Pang
, Ruochun Jin
, Wenyuan Yu
:
Linking Entities across Relations and Graphs. 2:1-2:50 - Zhaoguo Wang
, Chuzhe Tang
, Xiaodong Zhang
, Qianmian Yu
, Binyu Zang
, Haibing Guan
, Haibo Chen
:
Ad Hoc Transactions through the Looking Glass: An Empirical Study of Application-Level Transactions in Web Applications. 3:1-3:43 - Sabah Currim
, Richard T. Snodgrass
, Young-Kyoon Suh
:
Identifying the Root Causes of DBMS Suboptimality. 4:1-4:40
Volume 49, Number 2, June 2024
- Diego Arroyuelo
, Adrián Gómez-Brandón
, Aidan Hogan
, Gonzalo Navarro
, Juan L. Reutter
, Javiel Rojas-Ledesma
, Adrián Soto
:
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space. 5:1-5:45 - Adriane Chapman
, Luca Lauro
, Paolo Missier
, Riccardo Torlone
:
Supporting Better Insights of Data Science Pipelines with Fine-grained Provenance. 6:1-6:42 - Chao Zhang
, Farouk Toumani
:
Sharing Queries with Nonequivalent User-defined Aggregate Functions. 7:1-7:46 - Nofar Carmeli
, Martin Grohe
, Benny Kimelfeld
, Ester Livshits
, Muhammad Tibi
:
Database Repairing with Soft Functional Dependencies. 8:1-8:34
Volume 49, Number 3, September 2024
- David Tench
, Evan West
, Victor Zhang
, Michael A. Bender
, Abiyaz Chowdhury
, Daniel DeLayo
, J. Ahmed Dellas
, Martín Farach-Colton, Tyler Seip
, Kenny Zhang
:
GraphZeppelin: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive). 9:1-9:31 - Sebastián Bugedo
, Cristian Riveros
, Jorge Salas
:
A Family of Centrality Measures for Graph Data Based on Subgraphs. 10:1-10:45 - Shay Gershtein
, Uri Avron
, Ido Guy
, Tova Milo
, Slava Novgorodov
:
Automated Category Tree Construction: Hardness Bounds and Algorithms. 11:1-11:32 - Pan Hu
, Boris Motik
:
Accurate Sampling-Based Cardinality Estimation for Complex Graph Queries. 12:1-12:46
Volume 49, Number 4, December 2024
- Wei Dong
, Juanru Fang
, Ke Yi
, Yuchao Tao
, Ashwin Machanavajjhala
:
Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys. 13:1-13:40 - Michael Benedikt
, Maxime Buron
, Stefano Germano
, Kevin Kappelmann
, Boris Motik
:
Rewriting the Infinite Chase for Guarded TGDs. 14:1-14:44 - Martin Muñoz
, Cristian Riveros
:
Streaming Enumeration on Nested Documents. 15:1-15:39 - Wenfei Fan
, Kehan Pang
, Ping Lu
, Chao Tian
:
Making It Tractable to Detect and Correct Errors in Graphs. 16:1-16:75

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.