Concept

Traitement transactionnel en ligne

Publications associées (43)

Improving OLTP Scalability Using Speculative Lock Inheritance

Anastasia Ailamaki, Frederick Ryan Johnson, Ippokratis Pandis

Transaction processing workloads provide ample request level concurrency which highly parallel architectures can exploit. However, the resulting heavy utilization of core database services also causes resource contention within the database engine itself a ...

2009

A Scalable, Predictable Join Operator for Highly Concurrent Data Warehouses

George Candea

Conventional data warehouses employ the query-at-a-time model, which maps each query to a distinct physical plan. When several queries execute concurrently, this model introduces contention, because the physical plans—unaware of each other—compete for acce ...

2009

An Economic Model for Self-tuned Cloud Caching

Anastasia Ailamaki, Debabrata Dash

Cloud computing, the new trend for service infrastructures requires user multi-tenancy as well as minimal capital expenditure. In a cloud that services large amounts of data that are massively collected and queried, such as scientific data, users typically ...

2009

Sensor Metadata Management and its Application in Collaborative Environmental Research

Karl Aberer, Michael Lehning, Sebastian Michel

This paper considers metadata generation and tracking in a collaborative environment where users publish raw sensor data in the form of virtual sensors and post-process data by means of filtering, modeling, or query processing techniques. In the metadata s ...

2008

Infrastructure for data processing in large-scale interconnected sensor networks

Karl Aberer, Manfred Hauswirth, Ali Salehi

With the price of wireless sensor technologies diminishing rapidly we can expect large numbers of autonomous sensor networks being deployed in the near future. These sensor networks will typically not remain isolated but the need of interconnecting them on ...

IEEE Computer Society2007

To Share or Not To Share?

Anastasia Ailamaki, Babak Falsafi, Frederick Ryan Johnson, Ippokratis Pandis

Intuitively, aggressive work sharing among concurrent queries in a database system should always improve performance by eliminating redundant computation or data accesses. We show that, contrary to common intuition, this is not always the case in practice, ...

2007

Distributed Cache Table: Efficient Query-Driven Processing of Multi-Term Queries in P2P Networks

Gleb Skobeltsyn

The state-of-the-art techniques for processing multi-term queries in P2P environments are query flooding and inverted list intersection. However, it has been shown that due to scalability reasons both methods fail to support full-text search in large scale ...

2006

Distributed Cache Table: Efficient Query-Driven Processing of Multi-Term Queries in P2P Networks

Karl Aberer, Gleb Skobeltsyn

2006

Consistent Main-Memory Database Federations under Deferred Disk Writes

Rodrigo Malta Schmidt, Fernando Pedone

Current cluster architectures provide the ideal environment to run federations of main-memory database systems (FMMDBs). In FMMDBs, data resides in the main memory of the federation servers. FMMDBs significantly improve performance by avoiding I/O during t ...

2005

Consistent Main-Memory Database Federations under Deferred Disk Writes

Rodrigo Malta Schmidt, Fernando Pedone

Current cluster architectures provide the ideal environment to run federations of main-memory database systems (FMMDBs). In FMMDBs, data resides in the main memory of the federation servers, significantly improving performance by avoiding I/O during the ex ...

2005

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