Visualization-aware sampling for very large databases
Authors:
- 1 May 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 755-766
Abstract
Interactive visualizations are crucial in ad hoc data exploration and analysis. However, with the growing number of massive datasets, generating visualizations in interactive timescales is increasingly challenging. One approach for improving the speed of the visualization tool is via data reduction in order to reduce the computational overhead, but at a potential cost in visualization accuracy. Common data reduction techniques, such as uniform and stratified sampling, do not exploit the fact that the sampled tuples will be transformed into a visualization for human consumption. We propose a visualization-aware sampling (VAS) that guarantees high quality visualizations with a small subset of the entire dataset. We validate our method when applied to scatter and map plots for three common visualization goals: regression, density estimation, and clustering. The key to our sampling method's success is in choosing a set of tuples that minimizes a visualization-inspired loss function. While existing sampling approaches minimize the error of aggregation queries, we focus on a loss function that maximizes the visual fidelity of scatter plots. Our user study confirms that our proposed loss function correlates strongly with user success in using the resulting visualizations. Our experiments show that (i) VAS improves user's success by up to 35% in various visualization tasks, and (ii) VAS can achieve a required visualization quality up to 400× faster.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- CliffGuard2015
- SeeDBProceedings of the VLDB Endowment, 2013
- Dynamic reduction of query result sets for interactive visualizaton2013
- BlinkDB2013
- A Multi-Threading Architecture to Support Interactive Visual ExplorationIEEE Transactions on Visualization and Computer Graphics, 2009
- The Dense k -Subgraph ProblemAlgorithmica, 2001
- Response time and display rate in human performance with computersACM Computing Surveys, 1984
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Response time in man-computer conversational transactions1968