Lecture

Hashing and Sorting Techniques in Database Systems

Related lectures (24)

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

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

Covers B+ Trees, a key data structure for efficient indexing in databases.

Explores file organization, indexing techniques, and metadata in databases, emphasizing the importance of choosing the right search key.

Covers the efficient implementation of hash tables and the Quick Sort algorithm.

Provides an overview of essential search and sort algorithms in computer science.

Covers query processing with relational operations, including query optimization and different join algorithms.

Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.

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

Discusses advanced query operators, focusing on join techniques and their processing methods in relational databases.

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.