Publications associées à Réplication multi-maîtres

One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage

Anastasia Ailamaki, Periklis Chrysogelos, Angelos Christos Anadiotis, Syed Mohammad Aunn Raza

Most modern in-memory online transaction processing (OLTP) engines rely on multi-version concurrency control (MVCC) to provide data consistency guarantees in the presence of conflicting data accesses. MVCC improves concurrency by generating a new version o ...

ACM2023

Two-level Data Augmentation for Calibrated Multi-view Detection

Pascal Fua, Martin Pierre Engilberge, Zhiye Wang, Haixin Shi

Data augmentation has proven its usefulness to improve model generalization and performance. While it is commonly applied in computer vision application when it comes to multi-view systems, it is rarely used. Indeed geometric data augmentation can break th ...

2023

Theory-based scaling laws of near and far scrape-off layer widths in single-null L-mode discharges

Paolo Ricci, Holger Reimerdes, Jan Horacek, Cedric Kar-Wai Tsui, Maurizio Giacomin, Adriano Stagni

Theory-based scaling laws of the near and far scrape-off layer (SOL) widths are analytically derived for L-mode diverted tokamak discharges by using a two-fluid model. The near SOL pressure and density decay lengths are obtained by leveraging a balance amo ...

2021

Cluster-and-Conquer: When Randomness Meets Graph Locality

Anne-Marie Kermarrec, Olivier Ruas

K-Nearest-Neighbors (KNN) graphs are central to many emblematic data mining and machine-learning applications. Some of the most efficient KNN graph algorithms are incremental and local: they start from a random graph, which they incrementally improve by tr ...

IEEE COMPUTER SOC2021

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication

Willy Zwaenepoel, Diego Didona, Kristina Spirovska

Geo-replicated data platforms are the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the syn ...

IEEE COMPUTER SOC2019

Slalom: Coasting Through Raw Data via Adaptive Partitioning and Indexing

Anastasia Ailamaki, Manolis Karpathiotakis, Ioannis Alagiannis, Manoussos Gavriil Athanassoulis, Matthaios Alexandros Olma

The constant flux of data and queries alike has been pushing the boundaries of data analysis systems. The increasing size of raw data files has made data loading an expensive operation that delays the data-to-insight time. Hence, recent in-situ query proce ...

VLDB Endowment2017

Predicting Replicated Database Scalability from Standalone Database Profiling

Willy Zwaenepoel, Sameh Mohamed Elnikety, Emmanuel Cecchet

This paper develops analytical models to predict the throughput and the response time of a replicated database using measurements of the workload on a standalone database. These models allow workload scalability to be estimated before the replicated system ...

2009

Middleware-based Database Replication: The Gaps Between Theory and Practice

Anastasia Ailamaki, George Candea, Emmanuel Cecchet

The need for high availability and performance in data management systems has been fueling a long running interest in database replication from both academia and industry. However, academic groups often attack replication problems in isolation, overlooking ...

ACM2008

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Réplication multi-maîtres

One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage

Two-level Data Augmentation for Calibrated Multi-view Detection

Theory-based scaling laws of near and far scrape-off layer widths in single-null L-mode discharges

Cluster-and-Conquer: When Randomness Meets Graph Locality

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication

Slalom: Coasting Through Raw Data via Adaptive Partitioning and Indexing

Program Analysis and Compilation Techniques for Speeding up Transactional Database Workloads

Predicting Replicated Database Scalability from Standalone Database Profiling

Deferred-update database replication

Middleware-based Database Replication: The Gaps Between Theory and Practice

Graph Chatbot

Chattez avec Graph Search

Program Analysis and Compilation Techniques for Speeding up Transactional Database Workloads

One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage

Middleware-based Database Replication: The Gaps Between Theory and Practice

Cluster-and-Conquer: When Randomness Meets Graph Locality

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication

Theory-based scaling laws of near and far scrape-off layer widths in single-null L-mode discharges

Two-level Data Augmentation for Calibrated Multi-view Detection

Slalom: Coasting Through Raw Data via Adaptive Partitioning and Indexing

Deferred-update database replication

Predicting Replicated Database Scalability from Standalone Database Profiling