Lecture

Conditional Queries

Graph Chat

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.

Description

This lecture introduces conditional queries in the context of geographic information systems, covering the syntax of conditional queries, understanding how joins work, and the use of WHERE clause for filtering data. The lecture also explains operators like IN, BETWEEN, IS NULL, and LIKE, and how to combine conditions using AND and OR. It delves into different types of joins, such as INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN, to combine information from multiple tables based on common fields.

In MOOC

Geographical Information Systems 1

In this first part of the course, we will focus on the digitization and the storage of geodata. In particular, you will learn:

To characterize spatial objects and/or phenomena (territory modeling) with respect to their position in space (through coordinate systems, projections, and spatial relationships) and according to their intrinsic nature (object/vector mode vs. Image/raster mode);
About the different means used to acquire spatial data; including direct measurement, georeferencing images, digitiza

Official source

Quiz

Ontological neighbourhood

Computer engineering

Databases: Relational databases

Related concepts (32)

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.

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.

Sort-merge join

The sort-merge join (also known as merge join) is a join algorithm and is used in the implementation of a relational database management system. The basic problem of a join algorithm is to find, for each distinct value of the join attribute, the set of tuples in each relation which display that value. The key idea of the sort-merge algorithm is to first sort the relations by the join attribute, so that interleaved linear scans will encounter these sets at the same time.

Relational operator

In computer science, a relational operator is a programming language construct or operator that tests or defines some kind of relation between two entities. These include numerical equality (e.g., 5 = 5) and inequalities (e.g., 4 ≥ 3). In programming languages that include a distinct boolean data type in their type system, like Pascal, Ada, or Java, these operators usually evaluate to true or false, depending on if the conditional relationship between the two operands holds or not.

Differential operator

In mathematics, a differential operator is an operator defined as a function of the differentiation operator. It is helpful, as a matter of notation first, to consider differentiation as an abstract operation that accepts a function and returns another function (in the style of a higher-order function in computer science). This article considers mainly linear differential operators, which are the most common type. However, non-linear differential operators also exist, such as the Schwarzian derivative.

Related lectures (64)

Query Processing: Relational Operations and Models

Discusses query processing models and relational operations, focusing on selections, projections, and joins in data-intensive systems.

Relational Algebra

Introduces relational query languages, focusing on algebra operators and query optimization.

Conditional queries: An Introduction to GIS MOOC: Geographical Information Systems 1

Covers conditional queries and joins in GIS, explaining operators and attribute selection based on conditions.

Aggregation queries and sorting MOOC: Geographical Information Systems 1

Covers aggregation queries and sorting of results in Geographic Information Systems.

Query Operators: Part 1