cs.DB · 2026-07-08 · No. 47
Databases, 2026-07-08.
2 new papers in cs.DB. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
2 entries-
01
Efficient and Robust Lock-Free Multi-Word Compare-and-Swap via Contention-Aware Helping
Motoki Unno, Kento Sugiura, Yoshiharu Ishikawa
cs.DB · cs.DC · cs.DS
Efficient concurrent access to shared memory remains a central focus for researchers seeking to enhance data structure performance. Lock-based synchronization often limits scalability and introduces liveness issues such as deadlocks. In contrast, implementing non-blocking structures with single-word compare-and-swap (CAS) instructions increases algorithmic complexity because of unavoidable intermediate states. Multi-word compare-and-swap...
-
02
Discovering Frequent Closed Embedded Sub-DAGs in Spatio-Temporal Event Data
Piotr S. Maciąg
cs.DB · cs.LG
We propose a novel approach to mine patterns in spatio-temporal event data based on discovering frequent closed embedded sub-Directed Acyclic Graphs (DAGs). In our method, event instances are represented as nodes labelled by event types, while edges capture spatio-temporal following relationships. We formally define the considered class of patterns and provide the rationale for focusing on closed sub-DAGs as compact and non-redundant...
This edition is part of The Daily Abstract — cs.DB archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.