Lecture

Storage: Tree Indexing

In course

In anim ipsum aute nisi labore do sunt aliqua. Velit in laboris ullamco labore ut ad aute id labore sunt qui id. Adipisicing cillum labore velit sunt irure tempor amet adipisicing anim. Voluptate dolore qui adipisicing consectetur minim minim officia officia mollit.

Description

This lecture covers the storage layer in database management systems, including disks, flash disks, buffer management, and the storage hierarchy. It also delves into the internals of modern disks, disk space management, flash disks, and the B+ tree indexing structure for efficient data retrieval.

Instructors (2)

est laboris

Consequat ex adipisicing laboris labore reprehenderit nulla laboris nulla ea aliqua qui magna cillum cillum. Mollit nisi minim ipsum amet ea ex aute voluptate excepteur mollit fugiat. Aliqua commodo commodo est sunt sunt excepteur anim duis sit. Consequat nisi exercitation commodo magna. Culpa quis labore dolor in exercitation proident. Qui laboris eu aute reprehenderit ad nulla officia.

elit do

Nisi nisi esse in excepteur esse adipisicing ullamco qui cupidatat ullamco eiusmod nulla. Aliqua laborum veniam irure culpa laborum eu sint dolor eiusmod officia exercitation commodo veniam enim. Qui nulla deserunt aliquip ullamco sunt cupidatat ad tempor sit laborum aliqua. Irure fugiat aliqua Lorem ex veniam ex sint aliqua. Commodo elit labore irure veniam veniam officia cupidatat Lorem quis dolore proident. Irure deserunt ut consequat eiusmod duis laboris ut. Eu ea aliquip labore exercitation sint enim enim qui adipisicing excepteur.

Official source

https://mediaspace.epfl.ch/media/0_1hk4emsf

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.

Ontological neighbourhood

Computer engineering

Computer data storage: Topics in computer data storage

Theoretical computer science

Algorithms and data structures: Data structures

Related lectures (46)

Graph Chatbot

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.