Concept

Moteur de base de données

Publications associées (34)

Flash in a DBMS: Where and How?

Anastasia Ailamaki, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica

Over the past decade, new solid state storage technologies, with flash being the most mature one, have become increasingly popular. Such technologies store data durably, and can alleviate many handicaps of hard disk drives (HDDs). Nonetheless, they have ve ...

2010

Data-Oriented Transaction Execution

Anastasia Ailamaki, Frederick Ryan Johnson, Ippokratis Pandis

While hardware technology has undergone major advancements over the past decade, transaction processing systems have remained largely unchanged. The number of cores on a chip grows exponentially, following Moore's Law, allowing for an ever-increasing numbe ...

2010

, ,

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

We introduce AdaptPD, an automated physical design tool that improves database performance by continuously monitoring changes in the workload and adapting the physical design to suit the incoming workload. Current physical design tools are offline and requ ...

2009

Critical Sections: Re-Emerging Scalability Concerns for Database Storage Engines

Anastasia Ailamaki, Frederick Ryan Johnson, Ippokratis Pandis

Critical sections in database storage engines impact performance and scalability more as the number of hardware contexts per chip continues to grow exponentially. With enough threads in the system, some critical section will eventually become a bottleneck. ...

2008

A Conceptual View on Trajectories

Stefano Spaccapietra, Christine Parent, Christelle Vangenot, Maria Luisa Damiani, José Antonio Fernandes de Macedo

Analysis of trajectory data is the key to a growing number of applications aiming at global understanding and management of complex phenomena that involve moving objects (e.g. worldwide courier distribution, city traffic management, bird migration monitori ...

2007

Capacity upper bounds for the deletion channel

Suhas Diggavi, Henry Pfister

We present two upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. The first can be numerically evaluated for any fixed d. The second provides an asymptotic upper bound as ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

C-JDBC: Flexible Database Clustering Middleware

Willy Zwaenepoel, Emmanuel Cecchet

Large web or e-commerce sites are frequently hosted on clusters. Successful open-source tools exist for clustering the front tiers of such sites (web servers and application servers). No comparable success has been achieved for scaling the backend database ...

2004

Conflict-Aware Scheduling for Dynamic Content Applications

Willy Zwaenepoel

We present a new lazy replication technique, suitable for scaling the back-end database of a dynamic content site using a cluster of commodity computers. Our technique, called conflict-aware scheduling, provides both throughput scaling and 1-copy serializa ...

2003

Walking Four Machines By The Shore

Anastasia Ailamaki

Recent studies have shown that the hardware behavior of database workloads is suboptimal when compared to scientific workloads, and have identified the processor and memory subsystem as the true performance bottlenecks, when running decision-support worklo ...

2001

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