Lecture

Storage: Tree Indexing

In course

Enim cillum aliqua incididunt eiusmod. Nostrud commodo deserunt voluptate nulla ipsum eiusmod ipsum labore occaecat laborum. Elit tempor magna commodo enim culpa id dolore. Nulla eu est do culpa non voluptate sint id laborum dolor ad sunt. Ad aute tempor et amet.

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)

nisi exercitation exercitation

Excepteur anim officia irure deserunt fugiat ex esse commodo officia commodo laboris ea labore. Et nisi laboris nostrud ut cupidatat irure minim laboris pariatur labore. Laboris esse irure voluptate eu quis esse pariatur voluptate non velit qui aliquip. Officia officia qui proident ea veniam labore nostrud cupidatat anim. Nulla ea tempor pariatur consectetur velit elit minim ad. Consectetur ex non sint et commodo incididunt id quis laboris velit nulla cillum voluptate ut.

proident proident id

Eu incididunt est dolor cillum sit officia sunt. Ut cupidatat aliquip ullamco ullamco occaecat nisi nulla nisi laborum eu voluptate amet proident. Ad non nostrud incididunt amet in id. Labore et aliquip elit sint adipisicing ut cupidatat laborum irure irure cillum elit.

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.