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课程的讲义, 针对大规模数据的算法技巧进行介绍：数据过大以至于无法在计算机内存中存储。大体来讲，处理大规模数据有两种解决方法：无损数据结构和有损数据草图。这份笔记涵盖了后者：概率过滤器、使用不同度量的草图、局部敏感哈希、最近邻搜索、流算法（模式匹配、计数）。