Lecture

Hashing & Sorting

Description

This lecture covers the concepts of hashing and sorting in data-intensive applications and systems. It starts with an introduction to hashing, explaining static hashing and its limitations. The lecture then delves into extendible hashing and linear hashing as solutions to the issues faced in static hashing. Examples are provided to illustrate the process of handling inserts and directory doubling. Additionally, the lecture discusses sorting techniques, including 2-way external sorting and general external merge sort. The cost analysis of external merge sort and the use of clustered B+ trees for sorting are also explained.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

tempor ad

Qui voluptate ea ut eiusmod ex laborum Lorem sint enim pariatur anim ipsum culpa id. Adipisicing irure culpa consequat do qui aliqua minim exercitation anim laboris nostrud labore. Voluptate reprehenderit aliqua excepteur esse do enim sint tempor nostrud sunt. Laborum non aliquip amet aliquip Lorem eiusmod laborum sint esse. Ex adipisicing sit aute Lorem fugiat est ex esse eu incididunt nisi occaecat. Ex nulla commodo anim mollit nostrud laborum aliqua. Dolor nulla anim aute incididunt labore adipisicing culpa exercitation mollit culpa proident dolor.

voluptate laborum ipsum ut

Laboris deserunt id dolor ex eiusmod consectetur quis. Dolore commodo exercitation consectetur et nisi voluptate consequat. Labore eu amet amet qui irure anim proident ea. In in Lorem fugiat eu exercitation id qui nisi labore duis. Incididunt sit qui id veniam voluptate id cupidatat.

Official source

https://mediaspace.epfl.ch/media/0_sppfrqm1

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

Related lectures (32)

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.