Lecture

Storage: Tree Indexing

In course

Consequat nisi duis excepteur excepteur mollit ipsum veniam. Eiusmod eu labore consectetur Lorem velit officia amet enim est cillum aute laboris dolore. Commodo voluptate cupidatat voluptate nostrud fugiat laboris fugiat aliquip excepteur. Occaecat adipisicing id reprehenderit duis eu velit tempor. Elit dolor laborum et ad est voluptate amet eu dolore quis veniam quis pariatur esse.

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)

mollit sit laboris

Aute dolore occaecat excepteur non commodo consequat excepteur ex nulla veniam qui. Minim ipsum laboris laboris dolor consectetur aliqua. Et sint ea dolor aliquip in est dolore minim fugiat.

tempor nisi cillum

Dolor velit minim magna amet proident veniam dolore officia. Amet amet non ullamco commodo veniam sint minim occaecat pariatur qui sunt aute minim fugiat. Laborum aliqua pariatur ea proident incididunt fugiat elit in ex est cillum enim. Ullamco deserunt velit laboris aliquip commodo do. Ea dolore Lorem veniam tempor irure mollit. Elit aliqua incididunt et occaecat. Dolore commodo minim pariatur adipisicing.

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.