首页> 外文会议>2012 IEEE 26th International Parallel and Distributed Processing Symposium >Multi-level Layout Optimization for Efficient Spatio-temporal Queries on ISABELA-compressed Data
【24h】

Multi-level Layout Optimization for Efficient Spatio-temporal Queries on ISABELA-compressed Data

机译:高效的时空查询对ISABELA压缩数据的多层布局优化

获取原文
获取原文并翻译 | 示例

摘要

The size and scope of cutting-edge scientific simulations are growing much faster than the I/O subsystems of their runtime environments, not only making I/O the primary bottleneck, but also consuming space that pushes the storage capacities of many computing facilities. These problems are exacerbated by the need to perform data-intensive analytics applications, such as querying the dataset by variable and spatio-temporal constraints, for what current database technologies commonly build query indices of size greater than that of the raw data. To help solve these problems, we present a parallel query-processing engine that can handle both range queries and queries with spatio-temporal constraints, on B-spline compressed data with user-controlled accuracy. Our method adapts to widening gaps between computation and I/O performance by querying on compressed metadata separated into bins by variable values, utilizing Hilbert space-filling curves to optimize for spatial constraints and aggregating data access to improve locality of per-bin stored data, reducing the false positive rate and latency bound I/O operations (such as seek) substantially. We show our method to be efficient with respect to storage, computation, and I/O compared to existing database technologies optimized for query processing on scientific data.
机译:尖端科学仿真的规模和范围的增长速度远远超过其运行时环境的I / O子系统,不仅使I / O成为主要瓶颈,而且还占用了推动许多计算设施存储容量的空间。由于需要执行数据密集型分析应用程序(例如,通过变量和时空约束来查询数据集),因此当前的数据库技术通常会构建比原始数据更大的查询索引,从而使这些问题更加恶化。为了帮助解决这些问题,我们提出了一个并行查询处理引擎,该引擎可以处理B样条压缩数据且具有用户控制的精度,可以同时处理范围查询和具有时空约束的查询。我们的方法通过查询按变量值分成多个bin的压缩元数据,利用希尔伯特空间填充曲线优化空间约束并汇总数据访问以改善每个bin存储的数据的局部性来适应计算和I / O性能之间的差距,大幅降低误报率和等待时间,从而限制了I / O操作(例如搜索)。与针对科学数据进行查询处理而优化的现有数据库技术相比,我们证明了该方法在存储,计算和I / O方面是高效的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号