Data-intensive spatial filtering in large numerical simulation datasets

  • Authors:

  • Kalin Kanov;Randal Burns;Greg Eyink;Charles Meneveau;Alexander Szalay

  • Affiliations:

  • Johns Hopkins University;Johns Hopkins University and Institute for Data Intensive Engineering and Science;Johns Hopkins University and Institute for Data Intensive Engineering and Science;Johns Hopkins University and Institute for Data Intensive Engineering and Science;Johns Hopkins University and Institute for Data Intensive Engineering and Science

  • Venue:
  • SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a query processing framework for the efficient evaluation of spatial filters on large numerical simulation datasets stored in a data-intensive cluster. Previously, filtering of large numerical simulations stored in scientific databases has been impractical owing to the immense data requirements. Rather, filtering is done during simulation or by loading snapshots into the aggregate memory of an HPC cluster. Our system performs filtering within the database and supports large filter widths. We present two complementary methods of execution: I/O streaming computes a batch filter query in a single sequential pass using incremental evaluation of decomposable kernels, summed volumes generates an intermediate data set and evaluates each filtered value by accessing only eight points in this dataset. We dynamically choose between these methods depending upon workload characteristics. The system allows us to perform filters against large data sets with little overhead: query performance scales with the cluster's aggregate I/O throughput.