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

Lecture

Aggregation queries and sorting

Description

This lecture introduces the logics of aggregation queries and sorting of the result in Geographic Information Systems. It covers aggregation functions like SUM, COUNT, AVG, MIN, and MAX, as well as the GROUP BY and HAVING clauses. The instructor demonstrates how to write aggregation queries, sort query results, and limit the number of records returned.

In MOOC

Geographical Information Systems 1

Official source

Quiz

Ontological neighbourhood

Mathematics

Algebra: Representation theory

Theoretical computer science

Algorithms and data structures: Analysis of algorithms

Related concepts (32)

Sorting algorithm

In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output.

Sorting

Sorting refers to ordering data in an increasing or decreasing manner according to some linear relationship among the data items. ordering: arranging items in a sequence ordered by some criterion; categorizing: grouping items with similar properties. Ordering items is the combination of categorizing them based on equivalent order, and ordering the categories themselves. In , arranging in an ordered sequence is called "sorting". Sorting is a common operation in many applications, and efficient algorithms have been developed to perform it.

Sorting network

In computer science, comparator networks are abstract devices built up of a fixed number of "wires", carrying values, and comparator modules that connect pairs of wires, swapping the values on the wires if they are not in a desired order. Such networks are typically designed to perform sorting on fixed numbers of values, in which case they are called sorting networks. Sorting networks differ from general comparison sorts in that they are not capable of handling arbitrarily large inputs, and in that their sequence of comparisons is set in advance, regardless of the outcome of previous comparisons.

External sorting

External sorting is a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted do not fit into the main memory of a computing device (usually RAM) and instead they must reside in the slower external memory, usually a disk drive. Thus, external sorting algorithms are external memory algorithms and thus applicable in the external memory model of computation. External sorting algorithms generally fall into two types, distribution sorting, which resembles quicksort, and external merge sort, which resembles merge sort.

Reductive group

In mathematics, a reductive group is a type of linear algebraic group over a field. One definition is that a connected linear algebraic group G over a perfect field is reductive if it has a representation that has a finite kernel and is a direct sum of irreducible representations. Reductive groups include some of the most important groups in mathematics, such as the general linear group GL(n) of invertible matrices, the special orthogonal group SO(n), and the symplectic group Sp(2n).

Related lectures (36)

Aggregation Query and Result Sorting MOOC: Geographical Information Systems 1

Covers aggregation logic, sorting results, and writing SQL queries based on specific attributes.

Optimization Algorithms: Greedy Approach

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

ServiceNow: Creating Dashboards and Reports

Explores creating dashboards in ServiceNow, focusing on advantages, transition from homepages, and important concepts like tasks and incidents.

Merge Sort: Sorting Algorithm

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

Maps: Key-Value Associations