![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.