Event Horizon: Asymmetric Dependencies for Fast Geo-Distributed Operations

Conference Paper (2026)
Author(s)

Jonathan Arns (KTH Royal Institute of Technology)

Harald Ng (KTH Royal Institute of Technology)

K. Psarakis (TU Delft - Data-Intensive Systems)

A Katsifodimos (TU Delft - Data-Intensive Systems)

Paris Carbone (Research Institutes of Sweden RISE, KTH Royal Institute of Technology, Swedish Institute of Computer Science)

URL related publication
https://www.vldb.org/cidrdb/papers/2026/p20-arns.pdf Final published version
More Info
expand_more
Publication Year
2026
Language
English
Publisher
VLDB Endowment
Event
Downloads counter
11
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Low-latency geo-distributed applications currently face the barrier of cross-site coordination for ensuring state consistency. Existing mixed-consistency models leverage the existence of strongly- and weakly-consistent operations in a given application, to avoid coordination whenever possible. However, existing approaches are rather pessimistic, coordinating more than is necessary.

In this paper, we introduce Semi-Linearizability (SL): a consistency model that executes application operations with linearizability guarantees only when strictly necessary, avoiding over-coordination. Specifically, we propose novel operation semantics that can encode ordering relationships between application operations and map them to coordination primitives. Our proposed semantics can be used to reason over latent, asymmetric dependencies between different operations and optimize their execution. We show how SL enables a new class of safe, uncoordinated operations that previous models would otherwise execute under globally strict order, while offering substantial performance gains without violating application invariants. To demonstrate the advantages of SL, we implemented DeMon, a system that achieves four orders of magnitude lower latency on the most frequent operation in the widely used RUBiS benchmark compared to state-of-the-art systems.