These are the lecture notes for the course CM0622 - Algorithms for Massive Data, Ca' Foscari University of Venice. The goal of this course is to introduce algorithmic techniques for dealing with massive data: data so large that it does not fit in the computer's memory. Broadly speaking, there are two main solutions to deal with massive data: (lossless) compressed data structures and (lossy) data sketches. These notes cover the latter topic: probabilistic filters, sketching under various metrics, Locality Sensitive Hashing, nearest neighbour search, algorithms on streams (pattern matching, counting).

翻译：本讲义为威尼斯大学CM0622课程《海量数据算法》的授课笔记。该课程旨在介绍处理海量数据的算法技术：即数据规模庞大至无法装入计算机内存。广义而言，处理海量数据主要有两种解决方案：（无损）压缩数据结构与（有损）数据草图。本讲义涵盖后者：概率滤波器、多度量空间中的草图技术、局部敏感哈希、最近邻搜索、流式算法（模式匹配、计数）。