Hashing and Sorting Techniques in Database Systems

Related lectures (24)

Page 2 of 3

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

Covers the Chord DHT in decentralized systems engineering, focusing on reliability, redundancy, and structure maintenance.

Covers the implementation of combiners in parallel programming in Scala, including efficient combine methods and set data structures.

Covers the basics of algorithms, the importance of studying them, data structures, and the impact of algorithms on various fields.

Explains two-phase construction for arrays, hash tables, and search trees in parallel.

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

Explores optimization problems and greedy algorithms for efficient decision-making.

Explores hash tables through the Birthday Paradox, collisions, and implementation methods.

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

Explores query processing steps, physical plans, pipelined execution, and hashing for projections and joins.