Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Query Operators: Part 1

In course

CS-322: Introduction to database systems

This course provides a deep understanding of the concepts behind data management systems. It covers fundamental data management topics such as system architecture, data models, query processing and optimization, database design, storage organization, and t ...

Description

This lecture covers the steps in query processing, including parsing, rewriting, selecting logical and physical plans, and executing queries. It delves into physical query plans, pipelined execution, materialization, and hashing for projections and joins. The instructor explains the concepts with examples and discusses the cost implications of different query processing techniques.

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 (3)

Angelos Christos Anadiotis

Anastasia Ailamaki

Christoph Koch

Official source

Ontological neighbourhood

Computer engineering

Databases: Relational databases

Hardware engineering: Microprocessors

Related concepts (32)

Query optimization

Query optimization is a feature of many relational database management systems and other databases such as NoSQL and graph databases. The query optimizer attempts to determine the most efficient way to execute a given query by considering the possible query plans. Generally, the query optimizer cannot be accessed directly by users: once queries are submitted to the database server, and parsed by the parser, they are then passed to the query optimizer where optimization occurs.

Join (SQL)

A join clause in the Structured Query Language (SQL) combines columns from one or more tables into a new table. The operation corresponds to a join operation in relational algebra. Informally, a join stitches two tables and puts on the same row records with matching fields : INNER, LEFT OUTER, RIGHT OUTER, FULL OUTER and CROSS. To explain join types, the rest of this article uses the following tables: Department.DepartmentID is the primary key of the Department table, whereas Employee.DepartmentID is a foreign key.

Database

In computing, a database is an organized collection of data (also known as a data store) stored and accessed electronically through the use of a database management system. Small databases can be stored on a , while large databases are hosted on computer clusters or cloud storage. The design of databases spans formal techniques and practical considerations, including data modeling, efficient data representation and storage, query languages, security and privacy of sensitive data, and distributed computing issues, including supporting concurrent access and fault tolerance.

Hash join

The hash join is an example of a join algorithm and is used in the implementation of a relational database management system. All variants of hash join algorithms involve building hash tables from the tuples of one or both of the joined relations, and subsequently probing those tables so that only tuples with the same hash code need to be compared for equality in equijoins. Hash joins are typically more efficient than nested loops joins, except when the probe side of the join is very small.

Speculative execution

Speculative execution is an optimization technique where a computer system performs some task that may not be needed. Work is done before it is known whether it is actually needed, so as to prevent a delay that would have to be incurred by doing the work after it is known that it is needed. If it turns out the work was not needed after all, most changes made by the work are reverted and the results are ignored. The objective is to provide more concurrency if extra resources are available.

Related lectures (33)

Relational Databases: Fundamentals and ACID Properties MOOC: Geographical Information Systems 1

Covers relational databases, transactions, and data consistency in the context of historical database typologies.

Querying a database: the SQL language MOOC: Geographical Information Systems 1

Covers the SQL language for interacting with databases through structured queries, including selecting, filtering, aggregating, and sorting data.

Relational Databases: Fundamentals MOOC: Geographical Information Systems 1

Covers relational and spatial databases, including storage, management systems, ACID properties, historical typologies, primary and foreign keys, and spatial functions.

Data Wrangling with Hadoop: Storage Formats and Hive

Explores data wrangling with Hadoop, emphasizing storage formats and Hive for big data processing.

Query Processing with Relational Operations Log in to Mediaspace to watch this video