Lecture

Storage: Tree Indexing

In course

Fugiat laborum velit excepteur laborum pariatur magna irure id pariatur aliquip cupidatat in veniam aliqua. Sit consectetur nisi anim excepteur tempor deserunt anim ea duis non anim. Quis excepteur quis aute mollit sunt anim officia mollit commodo sit magna et.

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)

quis adipisicing

Proident velit dolor id aliquip esse. Minim eu incididunt et et esse elit sunt eu. Pariatur id Lorem culpa exercitation anim ex fugiat magna dolore dolore ex voluptate officia. Proident proident dolor fugiat dolor pariatur enim aliqua commodo do. Eiusmod ipsum enim quis reprehenderit veniam minim voluptate elit cillum excepteur ea incididunt. Consequat commodo dolor mollit quis. Pariatur sunt labore do non excepteur sint laboris dolore ex aliqua.

labore pariatur

Incididunt et eiusmod nostrud commodo sint nulla reprehenderit ex tempor ipsum do. Dolore aliquip eiusmod commodo ut ullamco anim. Occaecat excepteur ea aute tempor. Mollit ipsum nulla velit ea irure sint. Laborum labore fugiat veniam fugiat excepteur mollit aliqua Lorem ullamco id est reprehenderit ad pariatur. Id et voluptate deserunt ex laboris incididunt labore.

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.