Using R-trees for interactive visualization of large multidimensional datasets

Authors:
Alfredo Giménez;René Rosenbaum;Mario Hlawitschka;Bernd Hamann
Affiliations:
Institute for Data Analysis and Visualization, Department of Computer Science, University of California, Davis, CA;Institute for Data Analysis and Visualization, Department of Computer Science, University of California, Davis, CA;Institute for Data Analysis and Visualization, Department of Computer Science, University of California, Davis, CA;Institute for Data Analysis and Visualization, Department of Computer Science, University of California, Davis, CA
Venue:
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
Year:
2010

Citing 5
Cited 1

Hierarchical parallel coordinates for exploration of large datasets

VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Visualizing multi-dimensional clusters, trends, and outliers using star coordinates

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Surface Extraction from Multi-field Particle Volume Data Using Multi-dimensional Cluster Visualization

IEEE Transactions on Visualization and Computer Graphics
Progressive Presentation of Large Hierarchies Using Treemaps

ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part II

Heidi visualization of R-tree structures over high dimensional data

SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Large, multidimensional datasets are difficult to visualize and analyze. Visualization interfaces are constrained in resolution and dimension, so cluttering and problems of projecting many dimensions into the available low dimensions are inherent. Methods of real-time interaction facilitate analysis, but often these are not available due to the computational complexity required to use them. By organizing the dataset into a level-of-detail (LOD) hierarchy, our proposed method solves problems of both inefficient interaction and visual cluttering. We do this by introducing an implementation of R-trees for large multidimensional datasets. We introduce several useful methods for interaction, by queries and refinement, to explain the relevance of interaction and show that it can be done efficiently with R-trees.We examine the applicability of hierarchical parallel coordinates to datasets organized within an R-tree, and build upon previous work in hierarchical star coordinates to introduce a novel method for visualizing bounding hyperboxes of internal R-tree nodes. Finally, we examine two datasets using our proposed method and present and discuss results.