Scalable Visual Hierarchy Exploration

  • Authors:
  • Ionel D. Stroe;Elke A. Rundensteiner;Matthew O. Ward

  • Affiliations:
  • -;-;-

  • Venue:
  • DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Modern computer applications, from business decision support to scientific data analysis, utilize visualization techniques to support exploratory activities. However, most existing visual exploration tools do not scale well for large data sets, i.e., the level of cluttering on the screen is typically unacceptable and the performance is poor. To solve the cluttered interface problem, visualization tools have recently been extended to support hierarchical views of the data, with support for focusing and drilling-down using interactive brushes. To solve the scalability problem, we now investigate how best to couple such a near real-time responsive visualization tool with a database management system. This integration must be done carefully, since the direct implementation of the visual user interactions on hierarchical datasets corresponds to recursive query processing and thus is highly inefficient. For this problem, we have developed a tree labeling method, called MinMax tree, that allows the movement of the on-line recursive processing into an off-line precomputation step. Thus at run time, the recursive processing operations translate into linear cost range queries. Secondly, we employ a main memory access strategy to support incremental loading of data into the main memory. The techniques have been incorporated into XmdvTool, a visual exploration tool, to achieve scalability. Lastly, we report experimental results that illustrate the impact of the proposed techniques on the system's overall performance.