DBScholar

Back to papers

Visualization-aware Time Series Min-Max Caching with Error Bound Guarantees

Summary: MinMaxCache: in-memory adaptive min/max cache that reuses prior results and selects aggregation granularities to produce approximate multivariate series visualizations with provable error bounds. Delivers interactive latency and up to 10× speedups versus exact methods, no heavy preprocessing or extra storage, while bounding visual distortion. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13629
Venue
VLDB
Year
2024
Pagerank
5.949572e-05
Overall Rank
6,180 | 57.61%
DOI
10.14778/3659437.3659460

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{maroulis_vldb24,
        title = {{Visualization-aware Time Series Min-Max Caching with Error Bound Guarantees}},
        author = {Maroulis, Stavros and Stamatopoulos, Vassilis and Papastefanatos, George and Terrovitis, Manolis},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {8},
        pages = {2091--2103},
        doi = {10.14778/3659437.3659460},
        url = {https://doi.org/10.14778/3659437.3659460},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers