Query-driven visualization of large data sets

We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is constrained to the subset of data deemed interesting by the user. In many scientific data analysis applications, "interesting" data can be defined by compound Boolean range queries of the form (temperature>1000) AND (70<pressure<90). As data sizes grow larger, a central challenge is to answer such queries as efficiently as possible. Prior work in the visualization community has focused on answering range queries for scalar fields within the context of accelerating the search phase of isosurface algorithms. In contrast, our work describes an approach that leverages state-of-the-art indexing technology from the scientific data management community called "bitmap indexing". Our implementation, which we call "DEX" (short for dextrous data explorer), uses bitmap indexing to efficiently answer multivariate, multidimensional data queries to provide input to a visualization pipeline. We present an analysis overview and benchmark results that show bitmap indexing offers significant storage and performance improvements when compared to previous approaches for accelerating the search phase of isosurface algorithms. More importantly, since bitmap indexing supports complex multidimensional, multivariate range queries, it is more generally applicable to scientific data visualization and analysis problems. In addition to benchmark performance and analysis, we apply DEX to a typical scientific visualization problem encountered in combustion simulation data analysis.

[1]  Arie Shoshani,et al.  An efficient compression scheme for bitmap indices , 2004 .

[2]  J. Wilhelms,et al.  Octrees for faster isosurface generation , 1992, TOGS.

[3]  Chris Henze,et al.  Large field visualization with demand-driven calculation , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[4]  C. C. Law,et al.  ParaView: An End-User Tool for Large-Data Visualization , 2005, The Visualization Handbook.

[5]  James P. Ahrens,et al.  Scout: a hardware-accelerated system for quantitatively driven visualization and analysis , 2004, IEEE Visualization 2004.

[6]  T. J. Jankun-Kelly,et al.  Detecting flaws and intruders with visual data analysis , 2004, IEEE Computer Graphics and Applications.

[7]  Arie Shoshani,et al.  Evaluation Strategies for Bitmap Indices with Binning , 2004, DEXA.

[8]  Hans-Peter Kriegel,et al.  VisDB: database exploration using multidimensional visualization , 1994, IEEE Computer Graphics and Applications.

[9]  William J. Schroeder,et al.  Interactive out-of-core isosurface extraction , 1998 .

[10]  Charles D. Hansen,et al.  Isosurfacing in span space with utmost efficiency (ISSUE) , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[11]  Sihem Amer-Yahia,et al.  Optimizing Queries on Compressed Bitmaps , 2000, VLDB.

[12]  Bernd Hamann,et al.  Iso-splatting: a point-based alternative to isosurface visualization , 2003, 11th Pacific Conference onComputer Graphics and Applications, 2003. Proceedings..

[13]  Daniel A. Keim,et al.  Visual data mining in large geospatial point sets , 2004, IEEE Computer Graphics and Applications.

[14]  Elizabeth G. Hetzler,et al.  Analysis experiences using information visualization , 2004, IEEE Computer Graphics and Applications.

[15]  Patrick E. O'Neil,et al.  Model 204 Architecture and Performance , 1987, HPTS.

[16]  Greg S. Schmidt,et al.  Multidimensional visual representations for underwater environmental uncertainty , 2004, IEEE Computer Graphics and Applications.

[17]  John Shalf,et al.  DEX: Increasing the Capability of Scientific Data Analysis Pipelines by Using Efficient Bitmap Indices to Accelerate Scientific Visualization , 2005, SSDBM.

[18]  Arie Shoshani,et al.  Grid Collector: Using an event catalog to speed up user analysisin distributed environment , 2004 .

[19]  Robert L. Grossman,et al.  The Tele-Immersive Data Explorer: A Distributed Architecture for Collaborative Interactive Visualization of Large Data-sets , 2000 .

[20]  Yannis E. Ioannidis,et al.  An efficient bitmap encoding scheme for selection queries , 1999, SIGMOD '99.

[21]  Arie Shoshani,et al.  On the performance of bitmap indices for high cardinality attributes , 2004, VLDB.

[22]  G. Antoshenkov,et al.  Byte-aligned bitmap compression , 1995, Proceedings DCC '95 Data Compression Conference.

[23]  E. M. Wright,et al.  Adaptive Control Processes: A Guided Tour , 1961, The Mathematical Gazette.

[24]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[26]  John Shalf,et al.  Performance Modeling for Grid-Based Visualization , 2004 .

[27]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[28]  Guang Chen,et al.  Visual analytics in the pharmaceutical industry , 2004, IEEE Computer Graphics and Applications.

[29]  Will Schroeder,et al.  EVITA: A Prototype System for Efficient Visualization and Interrogation of Terascale Datasets , 2000 .

[30]  Han-Wei Shen,et al.  A Near Optimal Isosurface Extraction Algorithm Using the Span Space , 1996, IEEE Trans. Vis. Comput. Graph..

[31]  Theodore Johnson,et al.  Performance Measurements of Compressed Bitmap Indices , 1999, VLDB.

[32]  Mohamed Ziauddin,et al.  Query processing and optimization in Oracle Rdb , 1996, The VLDB Journal.

[33]  Kesheng Wu,et al.  Improved searching for spatial features in spatio-temporal data , 2004 .

[34]  Xiaoqing Qu,et al.  An extended cuberille model for identification and display of 3D objects from 3D gray value data , 1992 .

[35]  Arie Shoshani,et al.  An Ecien t Compression Scheme For Bitmap Indices , 2006 .

[36]  Christopher J. Rutland,et al.  Terascale High-Fidelity Simulations of Turbulent Combustion with Detailed Chemistry , 2004 .