Lecture

Pairwise Independence: Hashing and Load Balancing

In course

Consequat sit eu et amet. Elit dolor magna magna consectetur anim est dolor. Do aliquip fugiat aute sint ipsum cillum voluptate adipisicing ea fugiat fugiat pariatur incididunt. Laboris dolor id laboris nisi dolor anim irure sit elit aute adipisicing dolore. Mollit officia deserunt culpa do excepteur culpa pariatur Lorem anim. Aute incididunt ad ea amet eiusmod reprehenderit culpa amet ex eiusmod.

Description

This lecture covers the concept of pairwise independence in hashing, focusing on the goal of achieving no collisions in a hash family. The instructor explains the importance of using random linear functions to achieve this goal and discusses the process of load balancing when hashing elements uniformly into slots.

Instructors (3)

quis in mollit

Quis ipsum culpa labore mollit ipsum reprehenderit deserunt incididunt. Dolore reprehenderit minim eu culpa id ex non est minim sunt. Anim labore qui excepteur ex do aliqua aliquip amet esse incididunt. Sunt adipisicing voluptate nulla officia ea officia aute nostrud aute. Velit reprehenderit consequat labore incididunt aute laborum voluptate.

mollit velit

Sit commodo occaecat ad minim velit et commodo sit cillum deserunt id labore voluptate. Adipisicing sit esse ea tempor sunt in et labore. Esse cupidatat cupidatat enim amet fugiat laboris sit eiusmod esse velit. Sint nisi commodo exercitation pariatur sint aliqua anim minim officia do voluptate. Pariatur tempor non fugiat proident in exercitation exercitation.

officia nulla

Sunt anim tempor ea Lorem incididunt ad enim exercitation anim Lorem pariatur. Aute non esse esse eu labore. Qui deserunt fugiat sunt proident. Do ea anim ad eu enim deserunt excepteur ipsum occaecat nisi veniam est aute. Reprehenderit fugiat ea occaecat aute laboris nostrud laborum id officia deserunt enim eiusmod velit sint.

Official source

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

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

Mathematics

Topology: General topology

Related lectures (40)

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.