Optimal distance bounds for fast search on compressed time-series query logs.
Michail Vlachos|Suleyman Serdar Kozat|Philip S. Yu
| Anthology ID: | DBLP:journals/tweb/VlachosKY10 |
|---|---|
| Year: | 2010 |
| Venue: | ACM Transactions on the Web |
| Pages: | 6:1-6:28 |
| URL: | https://doi.org/10.1145/1734200.1734203 |
| DOI: | https://doi.org/10.1145/1734200.1734203 |
| DBLP: | journals/tweb/VlachosKY10 |
| BibTeX: |
@article{vlachos-2010-optimal,
author = {Michail Vlachos and
Suleyman Serdar Kozat and
Philip S. Yu},
title = {{Optimal distance bounds for fast search on compressed time-series query logs}},
journal = {ACM Transactions on the Web},
volume = {4},
number = {2},
pages = {6:1--6:28},
year = {2010},
url = {https://doi.org/10.1145/1734200.1734203},
doi = {https://doi.org/10.1145/1734200.1734203}
}