Sketch 'Em All: Fast Approximate Similarity Search for Dynamic Data Streams.
Marc Bury|Chris Schwiegelshohn|Mara Sorella
| Anthology ID: | DBLP:conf/wsdm/BurySS18 |
|---|---|
| Volume: | Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, WSDM 2018, Marina Del Rey, CA, USA, February 5-9, 2018 |
| Year: | 2018 |
| Venue: | Web Search and Data Mining (WSDM) |
| Publisher: | ACM |
| Pages: | 72-80 |
| URL: | https://doi.org/10.1145/3159652.3159694 |
| DOI: | https://doi.org/10.1145/3159652.3159694 |
| DBLP: | conf/wsdm/BurySS18 |
| BibTeX: |
@inproceedings{bury-2018-sketch,
author = {Marc Bury and
Chris Schwiegelshohn and
Mara Sorella},
editor = {Yi Chang and
ChengXiang Zhai and
Yan Liu and
Yoelle Maarek},
title = {{Sketch 'Em All: Fast Approximate Similarity Search for Dynamic Data Streams}},
booktitle = {{Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, WSDM 2018, Marina Del Rey, CA, USA, February 5-9, 2018}},
pages = {72--80},
publisher = {ACM},
year = {2018},
url = {https://doi.org/10.1145/3159652.3159694},
doi = {https://doi.org/10.1145/3159652.3159694}
}