Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2301.00754 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912927066357760 |
|---|---|
| author | Prezza, Nicola |
| author_facet | Prezza, Nicola |
| contents | 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. There are two main solutions to deal with massive data: (lossless) compressed data structures and (lossy) data sketches. These notes cover both topics: compressed suffix arrays, probabilistic filters, sketching under various metrics, Locality Sensitive Hashing, nearest neighbour search, algorithms on streams. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2301_00754 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Algorithms for Massive Data -- Lecture Notes Prezza, Nicola Data Structures and Algorithms 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. There are two main solutions to deal with massive data: (lossless) compressed data structures and (lossy) data sketches. These notes cover both topics: compressed suffix arrays, probabilistic filters, sketching under various metrics, Locality Sensitive Hashing, nearest neighbour search, algorithms on streams. |
| title | Algorithms for Massive Data -- Lecture Notes |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2301.00754 |