36 citations · 148 across the 17 of their papers we have counts for
20 papers
A coordination-free, convergent, and safe replicated tree
Sreeja Nair, Filipe Meirim, Mário Pereira +2
The tree is an essential data structure in many applications. In a distributed application, such as a distributed file system, the tree is replicated.To improve performance and ava…
Towards application-specific query processing systems
Dimitrios Vasilas, Marc Shapiro, Bradley King +1
Database systems use query processing subsystems for enabling efficient query-based data retrieval. An essential aspect of designing any query-intensive application is tuning the q…
Invariant Safety for Distributed Applications
Sreeja Nair, Gustavo Petri, Marc Shapiro
We study a proof methodology for verifying the safety of data invariants of highly-available distributed applications that replicate state. The proof is (1) modular: one can reason…
Distributed transactional reads: the strong, the quick, the fresh \& the impossible
Alejandro Z. Tomsic, Manuel Bravo, Marc Shapiro
This paper studies the costs and trade-offs of providing transactional consistent reads in a distributed storage system. We identify the following dimensions: read consistency, rea…
Improving the "Correct Eventual Consistency" Tool
Sreeja Nair, Marc Shapiro
Preserving invariants while designing distributed applications under weak consistency models is difficult. The CEC (Correct Eventual Consistency Tool) is meant to aid the applicati…
Conflict-free Replicated Data Types (CRDTs)
Nuno Preguiça, Carlos Baquero, Marc Shapiro
A conflict-free replicated data type (CRDT) is an abstract data type, with a well defined interface, designed to be replicated at multiple processes and exhibiting the following pr…