Publications related to Optimistic concurrency control

Optimistic Causal Consistency for Geo-Replicated Key-Value Stores

Willy Zwaenepoel, Diego Didona, Kristina Spirovska

In this paper we present a new approach to implementing causal consistency in geo-replicated data stores, which we call Optimistic Causal Consistency (OCC). The optimism in our approach lies in that updates from a remote data center are immediately made vi ...

Ieee Computer Soc2017

Sequential Proximity: Towards Provably Scalable Concurrent Search Algorithms

Rachid Guerraoui, Vasileios Trigonakis, Karolos Antoniadis, Julien Michel Stainer

Establishing the scalability of a concurrent algorithm a priori, before implementing and evaluating it on a concrete multi-core platform, seems difficult, if not impossible. In the context of search data structures however, according to all practical work ...

Springer International Publishing2017

Optimistic Concurrency with OPTIK

Rachid Guerraoui, Vasileios Trigonakis

We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures. OPTIK relies on the commonly-used technique of version numbers for detecting conflicting concurrent operations. We show how to i ...

ACM Press2016

Scaling Up Mixed Workloads: A Battle of Data Freshness, Flexibility, and Scheduling

Anastasia Ailamaki, Iraklis Psaroudakis

The common "one size does not fit all" paradigm isolates transactional and analytical workloads into separate, specialized database systems. Operational data is periodically replicated to a data warehouse for analytics. Competitiveness of enterprises today ...

Springer-Verlag Berlin2015

Consistency Models in Distributed Systems with Physical Clocks

Jiaqing Du

Most existing distributed systems use logical clocks to order events in the implementation of various consistency models. Although logical clocks are straightforward to implement and maintain, they may affect the scalability, availability, and latency of t ...

EPFL2014

Transactions Chasing Scalability and Instruction Locality on Multicores

Pinar Tözün

For several decades, online transaction processing (OLTP) has been one of the main server applications that drives innovations in the data management ecosystem, and in turn the database and computer architecture communities. Recent hardware trends oblige s ...

EPFL2014

Scaling up Mixed Workloads: a Battle of Data Freshness, Flexibility, and Scheduling

Anastasia Ailamaki, Iraklis Psaroudakis

The common "one size does not fit all" paradigm isolates transactional and analytical workloads into separate, specialized database systems. Operational data is periodically replicated to a data warehouse for analytics. Competitiveness of enterprises today ...

Springer International Publishing AG2014

From A to E: Analyzing TPC’s OLTP Benchmarks -- The obsolete, the ubiquitous, the unexplored

Anastasia Ailamaki, Pinar Tözün, Ippokratis Pandis, Ilknur Cansu Kaynak, Dorde Jevdic

Introduced in 2007, TPC-E is the most recently standardized OLTP benchmark by TPC. Even though TPC-E has already been around for six years, it has not gained the popularity of its predecessor TPC-C: all the published results for TPC-E use a single database ...

2013

Scaling up analytical queries with column-stores

Anastasia Ailamaki, Ioannis Alagiannis, Manoussos Gavriil Athanassoulis

As data analytics is used by an increasing number of applications, data analytics engines are required to execute workloads with increased concurrency, i.e., an increasing number of clients submitting queries. Data management systems designed for data anal ...

2013

Sharing Data and Work Across Concurrent Analytical Queries

Anastasia Ailamaki, Manoussos Gavriil Athanassoulis, Iraklis Psaroudakis

Today's data deluge enables organizations to collect massive data, and analyze it with an ever-increasing number of concurrent queries. Traditional data warehouses (DW) face a challenging problem in executing this task, due to their query-centric model: ea ...

2013

Optimistic concurrency control

Optimistic Causal Consistency for Geo-Replicated Key-Value Stores

Sequential Proximity: Towards Provably Scalable Concurrent Search Algorithms

Optimistic Concurrency with OPTIK

Scaling Up Mixed Workloads: A Battle of Data Freshness, Flexibility, and Scheduling

Consistency Models in Distributed Systems with Physical Clocks

Transactions Chasing Scalability and Instruction Locality on Multicores

Scaling up Mixed Workloads: a Battle of Data Freshness, Flexibility, and Scheduling

From A to E: Analyzing TPC’s OLTP Benchmarks -- The obsolete, the ubiquitous, the unexplored

Scaling up analytical queries with column-stores

Sharing Data and Work Across Concurrent Analytical Queries

Graph Chatbot

Chat with Graph Search

Consistency Models in Distributed Systems with Physical Clocks

Scaling up analytical queries with column-stores

Scaling up Mixed Workloads: a Battle of Data Freshness, Flexibility, and Scheduling

Scaling Up Mixed Workloads: A Battle of Data Freshness, Flexibility, and Scheduling

Optimistic Causal Consistency for Geo-Replicated Key-Value Stores

From A to E: Analyzing TPC’s OLTP Benchmarks -- The obsolete, the ubiquitous, the unexplored

Transactions Chasing Scalability and Instruction Locality on Multicores

Sequential Proximity: Towards Provably Scalable Concurrent Search Algorithms

Optimistic Concurrency with OPTIK

Sharing Data and Work Across Concurrent Analytical Queries