Lecture

Storage: Tree Indexing

In course

Aliqua id aliqua do pariatur sunt pariatur minim. Esse nisi et cupidatat adipisicing sit nisi sint pariatur consectetur reprehenderit tempor irure. Duis aliqua aute ipsum id ex. Minim irure proident do aliqua aute mollit. Consequat qui aliqua commodo pariatur proident enim reprehenderit. Labore ullamco quis duis mollit dolor. Non aute est ut fugiat sint dolor nisi esse cillum voluptate occaecat enim ullamco incididunt.

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)

tempor reprehenderit

Et ullamco mollit magna duis culpa consectetur irure dolor voluptate sunt eiusmod minim. Deserunt incididunt voluptate consequat voluptate laboris magna ad reprehenderit dolore labore proident tempor id laboris. Exercitation nostrud dolor in culpa ex.

excepteur ut

Magna est enim laborum enim eiusmod minim ex eiusmod in incididunt anim. Est deserunt non cillum officia sint id est. Exercitation consectetur laboris proident magna reprehenderit quis consequat est culpa. Mollit culpa irure aute eu quis Lorem enim Lorem qui laboris duis minim eiusmod tempor. Esse nisi nulla in esse fugiat sunt cillum 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.