Continuous Prefetch for Interactive Data Applications
Haneen Mohammed, Ziyun Wei, Ravi Netravali, Eugene Wu
Abstract
Interactive data visualization and exploration (DVE) applications are often network-bottlenecked due to bursty request patterns, large response sizes, and heterogeneous deployments over a range of networks and devices. This makes it difficult to ensure consistently low response times (< 100ms). Khameleon is a framework for DVE applications that uses a novel combination of prefetching and response tuning to dynamically trade-off response quality for low latency. Khameleon exploits DVE's approximation tolerance: immediate lower-quality responses are preferable to waiting for complete results. To this end, Khameleon progressively encodes responses, and runs a server-side scheduler that proactively streams portions of responses using available bandwidth to maximize user-perceived interactivity. The scheduler involves a complex optimization based on available resources, predicted user interactions, and response quality levels; yet, decisions must also be made in real-time. To overcome this, Khameleon uses a fast greedy heuristic that closely approximates the optimal approach. Using image exploration and visualization applications with real user interaction traces, we show that across a wide range of network and client resource conditions, Khameleon outperforms existing prefetching approaches that benefit from perfect prediction models: Khameleon always lowers response latencies (typically by 2--3 orders of magnitude) while keeping response quality within 50--80%.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext cb344095-9e45-47fa-90b2-ea29969d9441Cited by top-tier papers6
- Mosaic: An Architecture for Scalable & Interoperable Data ViewsJeffrey Heer, Dominik MoritzIEEE VIS 2023 · 23 citations
- Studying Early Decision Making with Progressive Bar ChartsAmeya B. Patil, Gaëlle Richer, Christopher Jermaine, Dominik Moritz et al.IEEE VIS 2022 · 11 citations
- OM3: An Ordered Multi-level Min-Max Representation for Interactive Progressive Visualization of Time SeriesYunhai Wang, Yuchun Wang, Xin Chen, Yue Zhao et al.SIGMOD 2023 · 8 citations
- Optimizing Dataflow Systems for Scalable Interactive VisualizationJunran Yang, Hyekang Kevin Joo, Sai S. Yerramreddy, Dominik Moritz et al.SIGMOD 2024 · 8 citations
- FFL: A Language and Live Runtime for Styling and Labeling Typeset Math FormulasZhiyuan Wu, Jiening Li, Kevin Ma, Hita Kambhamettu et al.UIST 2023 · 5 citations
Builds on1
Related papers
- Visualization-aware Time Series Min-Max Caching with Error Bound GuaranteesStavros Maroulis, Vassilis Stamatopoulos, George Papastefanatos, Manolis TerrovitisVLDB 2024 · 8 citations
- Kamino: Efficient VM Allocation at Scale with Latency-Driven Cache-Aware SchedulingDavid Domingo, Hugo Barbalho, Marco Molinaro, Kuan Liu et al.OSDI 2025 · 2 citations
- Mosaic Selections: Managing and Optimizing User Selections for Scalable Data Visualization SystemsJeffrey Heer, Dominik Moritz, Ron PechukIEEE VIS 2025 · 2 citations
- Visualization-Oriented Progressive Time Series TransformationXin Chen, Lingyu Zhang, Huaiwei Bao, Wei Lu et al.SIGMOD 2026 · 1 citation
- ScaleTraversal: Creating Multi-Scale Biomedical Animation with Limited Hardware ResourcesRichen Liu, Hansheng Wang, Hailong Wang, Siru Chen et al.ACM MM 2024 · 2 citations
