Antidote SQL: Relaxed When Possible, Strict When Necessary

by   Pedro Lopes, et al.

Geo-replication poses an inherent trade-off between low latency, high availability and strong consistency. While NoSQL databases favor low latency and high availability, relaxing consistency, more recent cloud databases favor strong consistency and ease of programming, while still providing high scalability. In this paper, we present Antidote SQL, a database system that allows application developers to relax SQL consistency when possible. Unlike NoSQL databases, our approach enforces primary key, foreign key and check SQL constraints even under relaxed consistency, which is sufficient for guaranteeing the correctness of many applications. To this end, we defined concurrency semantics for SQL constraints under relaxed consistency and show how to implement such semantics efficiently. For applications that require strict SQL consistency, Antidote SQL provides support for such semantics at the cost of requiring coordination among replicas.


page 7

page 8

page 9

page 12

page 13

page 14


Compiling PL/SQL Away

"PL/SQL functions are slow," is common developer wisdom that derives fro...

Coo: Consistency Check for Transactional Databases

In modern databases, transaction processing technology provides ACID (At...

An experiment with denotational semantics

The paper is devoted to showing how to systematically design a programmi...

Manu: A Cloud Native Vector Database Management System

With the development of learning-based embedding models, embedding vecto...

Quantifying and Generalizing the CAP Theorem

In distributed applications, Brewer's CAP theorem tells us that when net...

One SQL to Rule Them All

Real-time data analysis and management are increasingly critical for tod...

Please sign up or login with your details

Forgot password? Click here to reset