Distributed Data Management for Large Volume Visualization
Citations Over TimeTop 10% of 2006 papers
Abstract
We propose a distributed data management scheme for large data visualization that emphasizes efficient data sharing and access. To minimize data access time and support users with a variety of local computing capabilities, we introduce an adaptive data selection method based on an enhanced time-space partitioning (ETSP) tree that assists with effective visibility culling, as well as multiresolution data selection. By traversing the tree, our data management algorithm can quickly identify the visible regions of data, and, for each region, adaptively choose the lowest resolution satisfying user-specified error tolerances. Only necessary data elements are accessed and sent to the visualization pipeline. To further address the issue of sharing large-scale data among geographically distributed collaborative teams, we have designed an infrastructure for integrating our data management technique with a distributed data storage system provided by logistical networking (LoN). Data sets at different resolutions are generated and uploaded to LoN for wide-area access. We describe a parallel volume rendering system that verifies the effectiveness of our data storage, selection and access scheme.
Related Papers
- → Deduplication of Textual Data by NLP Approaches(2023)1 cited
- → Multi-objective Based Performance Evaluation of Deduplication Approaches(2016)
- → Existing mechanisms for data deduplication(2021)
- A Data Deduplication Framework of Disk Images with Adaptive Block Skipping(2016)
- Metadata Feedback and Utilization for Data Deduplication Across WAN(2016)