Concept

Redis

Publications associées (14)

Fine-Grain Checkpointing with In-Cache-Line Logging

James Richard Larus, David Teksen Aksun, Nachshon Cohen

Non-Volatile Memory offers the possibility of implementing high-performance, durable data structures. However, achieving performance comparable to well-designed data structures in non-persistent (transient) memory is difficult, primarily because of the cos ...

ACM2019

Query Optimization in Oracle 12c Database In-Memory

Ramachandra Satyanarayana Valluri

Traditional on disk row major tables have been the dominant storage mechanism in relational databases for decades. Over the last decade, however, with explosive growth in data volume and demand for faster analytics, has come the recognition that a differen ...

2015

Top-k/w publish/subscribe: A publish/subscribe model for continuous top-k processing over data streams

Karl Aberer, Ivana Podnar, Kresimir Pripuzic

Continuous processing of top-k queries over data streams is a promising technique for alleviating the information overload problem as it distinguishes relevant from irrelevant data stream objects with respect to a given scoring function over time. Thus it ...

Wiley-Blackwell2014

Top-k/w publish/subscribe: A publish/subscribe model for continuous top-k processing over data streams

Karl Aberer, Kresimir Pripuzic

Pergamon-Elsevier Science Ltd2014

Linear Scalability of Distributed Applications

Nicolas Bonvin

The explosion of social applications such as Facebook, LinkedIn and Twitter, of electronic commerce with companies like Amazon.com and Ebay.com, and of Internet search has created the need for new technologies and appropriate systems to manage effectively ...

EPFL2012

The complexity of robust atomic storage

Rachid Guerraoui, Marko Vukolic

We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolerating the largest possible number t of Byzantine storage component failures ( ...

ACM Press2011

Deferred-update database replication

Rodrigo Malta Schmidt

This thesis is about the design of high-performance fault-tolerant computer systems. More specifically, it focuses on how to develop database systems that behave correctly and with good performance even in the event of failures. Both performance and depend ...

EPFL2008

Type-based event dissemination

Sébastien Bähni

With the explosion of broadband Internet connections in the late 80s, new types of applications, called distributed applications, came to light. These applications typically seek to provide a user with remote services that appear to that user as if they we ...

EPFL2006

Beyond 1-Safety and 2-Safety for replicated databases: Group-Safety

André Schiper, Matthias Wiesmann

In this paper, we study the safety guarantees of group communication-based database replication techniques. We show that there is a model mismatch between group communication and database, and because of this, classical group communication systems cannot b ...

2004

The many faces of publish/subscribe

Rachid Guerraoui, Anne-Marie Kermarrec, Patrick Eugster, Pascal Felber

Well adapted to the loosely coupled nature of distributed interaction in large-scale applications, the publish/subscribe communication paradigm has recently received increasing attention. With systems based on the publish/subscribe interaction scheme, subs ...

2003

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search