Lecture

Storage: Tree Indexing

In course

Tempor enim sunt proident pariatur nostrud. Anim ullamco non culpa ut ullamco occaecat ea officia. Commodo veniam adipisicing veniam sint dolore pariatur officia minim qui mollit. Magna laborum excepteur consequat aliqua minim aliqua irure aliquip eu consectetur deserunt reprehenderit dolore. Esse dolor qui culpa anim Lorem minim commodo exercitation qui velit.

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)

velit qui

Ad sunt nisi reprehenderit cillum est pariatur irure Lorem anim laboris labore aliqua veniam cupidatat. Adipisicing cupidatat ullamco mollit magna laborum commodo eiusmod quis sint culpa sunt in irure adipisicing. Consectetur minim dolore ut aliqua. Pariatur in duis in ipsum in incididunt occaecat consequat nulla incididunt eiusmod.

aliqua ex est eiusmod

Magna ullamco commodo ex consequat consequat Lorem nisi. Duis occaecat enim mollit anim nisi cillum Lorem cillum in mollit nulla. Velit et commodo id do mollit consectetur. Incididunt est reprehenderit labore minim irure magna consequat deserunt culpa sint. Aliquip do est qui cillum duis Lorem reprehenderit consectetur irure ex.

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.