## Sketching and Streaming High-Dimensional Vectors (2011)

Citations: | 1 - 0 self |

### BibTeX

@MISC{Nelson11sketchingand,

author = {Jelani Nelson and Erik D. Demaine},

title = {Sketching and Streaming High-Dimensional Vectors},

year = {2011}

}

### OpenURL

### Abstract

A sketch of a dataset is a small-space data structure supporting some prespecified set of queries (and possibly updates) while consuming space substantially sublinear in the space required to actually store all the data. Furthermore, it is often desirable, or required by the application, that the sketch itself be computable by a small-space algorithm given just one pass over the data, a so-called streaming algorithm. Sketching and streaming have found numerous applications in network traffic monitoring, data mining, trend detection, sensor networks, and databases. In this thesis, I describe several new contributions in the area of sketching and streaming algorithms. • The first space-optimal streaming algorithm for the distinct elements problem. Our algorithm also achieves O(1) update and reporting times. • A streaming algorithm for Hamming norm estimation in the turnstile model which achieves the best known space complexity.