Publication

Matching Database Access Patterns to Storage Characteristics

2003
Conference Papers

Abstract

Today’s storage interfaces hide device-specific details, simplifying system development and device interoperability. However, they prevent database systems from exploiting devices’ unique performance characteristics. Abstract and device-independent annotations to existing storage interfaces can cleanly expose key device characteristics that improve performance and simplify manual tuning. By automatically matching access patterns to device strengths, a database storage manager can achieve robust performance even with workloads competing for the same storage resource. For example, disk-optimized accesses result in simultaneous improvement of up to 3x for DSS workloads and 7% for a competing OLTP workload. As another example, accesses to relational tables can take advantage of MEMS-based storage parallelism to achieve order of magnitude improvements in selective scans.

Official source

https://infoscience.epfl.ch/entities/publication/a854c42d-e29e-4794-b2ef-8fe1510575bd

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2003
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/a854c42d-e29e-4794-b2ef-8fe1510575bd

About this result

Related concepts (32)

Relational database

A relational database is a (most commonly digital) database based on the relational model of data, as proposed by E. F. Codd in 1970. A system used to maintain relational databases is a relational database management system (RDBMS). Many relational database systems are equipped with the option of using SQL (Structured Query Language) for querying and updating the database. The term "relational database" was first defined by E. F. Codd at IBM in 1970. Codd introduced the term in his research paper "A Relational Model of Data for Large Shared Data Banks".

Database

In computing, a database is an organized collection of data (also known as a data store) stored and accessed electronically through the use of a database management system. Small databases can be stored on a , while large databases are hosted on computer clusters or cloud storage. The design of databases spans formal techniques and practical considerations, including data modeling, efficient data representation and storage, query languages, security and privacy of sensitive data, and distributed computing issues, including supporting concurrent access and fault tolerance.

Relational model

The relational model (RM) is an approach to managing data using a structure and language consistent with first-order predicate logic, first described in 1969 by English computer scientist Edgar F. Codd, where all data is represented in terms of tuples, grouped into relations. A database organized in terms of the relational model is a relational database.

Related publications (1)

Matching Database Access Patterns to Storage Characteristics

Chat with Graph Search

Generalized Snapshot Isolation and a Prefix-Consistent Implementation