Transformations for volumetric range distribution queries

Volumetric datasets continue to grow in size, and there is continued demand for interactive analysis on these datasets. Because storage device throughputs are not increasing as quickly, interactive analysis workflows are becoming working set-constrained. In an ideal workflow, the working set complexity of the interactive analysis portion of the workflow should depend primarily on the size of the analysis result being produced, rather than on the size of the data being analyzed. Past works in online analytical processing and visualization have addressed this problem within application-specific contexts, but have not generalized their solutions to a wider variety of visualization applications. We propose a general framework for reducing the working set complexity of the interactive portion of visualization workflows that can be built on top of distribution range queries, as well as a technique within this framework able to support multiple visualization applications. Transformations are applied in the preprocessing phase of the workflow to enable fast, approximate volumetric distribution range queries with low working set complexity. Interactive application algorithms are then adapted to make use of these distribution range queries, enabling efficient interactive workflows on large-scale data. We show that the proposed technique enables these applications to be scaled primarily in terms of the application result dataset size, rather than the input data size, enabling increased interactivity and scalability.

[1]  Fredrik Bengtsson,et al.  Space-Efficient Range-Sum Queries in OLAP , 2004, DaWaK.

[2]  Sudipto Guha,et al.  Space Efficiency in Synopsis Construction Algorithms , 2005, VLDB.

[3]  Valerio Pascucci,et al.  Analysis of large-scale scalar data using hixels , 2011, 2011 IEEE Symposium on Large Data Analysis and Visualization.

[4]  Viswanath Poosala,et al.  Fast approximate answers to aggregate queries on a data cube , 1999, Proceedings. Eleventh International Conference on Scientific and Statistical Database Management.

[5]  Peter J. Denning,et al.  Properties of the working-set model , 1972, CACM.

[6]  Divesh Srivastava,et al.  Optimal histograms for hierarchical range queries (extended abstract) , 2000, PODS '00.

[7]  Maria E. Orlowska,et al.  Range queries in dynamic OLAP data cubes , 2000, Data Knowl. Eng..

[8]  Anders Ynnerman,et al.  Local Histograms for Design of Transfer Functions in Direct Volume Rendering , 2006, IEEE Transactions on Visualization and Computer Graphics.

[9]  Divyakant Agrawal,et al.  Using wavelet decomposition to support progressive and approximate range-sum queries over data cubes , 2000, CIKM '00.

[10]  Jörg-Stefan Praßni,et al.  Stroke-Based Transfer Function Design , 2008, VG/PBG@SIGGRAPH.

[11]  Filippo Furfaro,et al.  Compressed hierarchical binary histograms for summarizing multi-dimensional data , 2007, Knowledge and Information Systems.

[12]  L. Ruby Leung,et al.  Moist Thermodynamics of the Madden–Julian Oscillation in a Cloud-Resolving Simulation , 2011 .

[13]  K. Knuth Optimal Data-Based Binning for Histograms , 2006, physics/0605197.

[14]  Kwan-Liu Ma,et al.  Visibility-driven transfer functions , 2009, 2009 IEEE Pacific Visualization Symposium.

[15]  E. Hovmöller,et al.  The Trough-and-Ridge diagram , 1949 .

[16]  Han-Wei Shen,et al.  Interactive transfer function design on large multiresolution volumes , 2012, IEEE Symposium on Large Data Analysis and Visualization (LDAV).

[17]  M. Wand Data-Based Choice of Histogram Bin Width , 1997 .

[18]  J. V. van Wijk,et al.  HyperSlice: visualization of scalar functions of many variables , 1993, VIS '93.

[19]  Panagiotis Karras Optimality and Scalability in Lattice Histogram Construction , 2009, Proc. VLDB Endow..

[20]  Wen-Chi Hou,et al.  Approximate Range-Sum Queries over Data Cubes Using Cosine Transform , 2008, DEXA.

[21]  Joe Michael Kniss,et al.  Multidimensional Transfer Functions for Interactive Volume Rendering , 2002, IEEE Trans. Vis. Comput. Graph..

[22]  Han-Wei Shen,et al.  Histogram spectra for multivariate time-varying volume LOD selection , 2011, 2011 IEEE Symposium on Large Data Analysis and Visualization.

[23]  Kwan-Liu Ma,et al.  End-to-end data reduction and hardware accelerated rendering techniques for visualizing time-varying non-uniform grid volume data , 2005, Fourth International Workshop on Volume Graphics, 2005..

[24]  Terence R. Smith,et al.  Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[25]  Han-Wei Shen,et al.  Semi‐Automatic Time‐Series Transfer Functions via Temporal Clustering and Sequencing , 2009, Comput. Graph. Forum.

[26]  Christopher M. Bishop,et al.  Pattern Recognition and Machine Learning (Information Science and Statistics) , 2006 .

[27]  Chin-Wan Chung,et al.  Space-efficient cubes for OLAP range-sum queries , 2004, Decis. Support Syst..

[28]  Sudipto Guha,et al.  Fast algorithms for hierarchical range histogram construction , 2002, PODS '02.

[29]  Thomas Malzbender,et al.  Fourier volume rendering , 1993, TOGS.

[30]  Fatih Murat Porikli,et al.  Integral histogram: a fast way to extract histograms in Cartesian spaces , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[31]  Valerio Pascucci,et al.  Global static indexing for real-time exploration of very large regular grids , 2001, SC.

[32]  Franklin C. Crow,et al.  Summed-area tables for texture mapping , 1984, SIGGRAPH.