Perfect hash function

Related lectures (32)

Page 1 of 4

Provides an overview of hashing and sorting techniques in database management systems, focusing on their implementation and performance optimization.

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.

Covers counting distinct elements using hash functions and the median trick.

Explores the analysis of running time in hash tables, covering successful searches, key distribution, and table size impact.

Explores probabilistic analysis in algorithms, covering the hiring problem and the birthday paradox, along with hash tables and functions.

Introduces hashing tables, including the Birthday Lemma, Direct-Address Tables, collisions, and Chained-Hash-Search.

Explores hash collisions, attacks on hash functions, and strategies for exploiting them in file formats like JPEG and PDF.

Explores hashing techniques like static, extendible, and linear hashing, along with sorting methods such as external merge sort and B+ trees.

Covers the implementation details of hash sets and related methods using IntelliJ IDEA.

Explores hashing fundamentals, applications in security, and common attacks on hash functions.