首页> 外文会议>IEEE international conference on data engineering >OCTOPUS: Efficient query execution on dynamic mesh datasets
【24h】

OCTOPUS: Efficient query execution on dynamic mesh datasets

机译:OCTOPUS:在动态网格数据集上高效执行查询

获取原文

摘要

Scientists in many disciplines use spatial mesh models to study physical phenomena. Simulating natural phenomena by changing meshes over time helps to better understand the phenomena. The higher the precision of the mesh models, the more insight do the scientists gain and they thus continuously increase the detail of the meshes and build them as detailed as their instruments and the simulation hardware allow. In the process, the data volume also increases, slowing down the execution of spatial range queries needed to monitor the simulation considerably. Indexing speeds up range query execution, but the overhead to maintain the indexes is considerable because almost the entire mesh changes unpredictably at every simulation step. Using a simple linear scan, on the other hand, requires accessing the entire mesh and the performance deteriorates as the size of the dataset grows. In this paper we propose OCTOPUS, a strategy for executing range queries on mesh datasets that change unpredictably during simulations. In OCTOPUS we use the key insight that the mesh surface along with the mesh connectivity is sufficient to retrieve accurate query results efficiently. With this novel query execution strategy, OCTOPUS minimizes index maintenance cost and reduces query execution time considerably. Our experiments show that OCTOPUS achieves a speedup between 7.3 and 9.2× compared to the state of the art and that it scales better with increasing mesh dataset size and detail.
机译:许多学科的科学家使用空间网格模型来研究物理现象。通过随时间改变网格来模拟自然现象有助于更好地理解现象。网格模型的精度越高,科学家获得的见识就越多,因此他们不断增加网格的细节,并在其仪器和仿真硬件允许的范围内尽可能详细地构建它们。在此过程中,数据量也会增加,从而大大降低了监视模拟所需的空间范围查询的执行速度。索引可以加快范围查询的执行速度,但是维护索引的开销却相当可观,因为几乎整个网格在每个模拟步骤中都会发生不可预测的变化。另一方面,使用简单的线性扫描需要访问整个网格,并且随着数据集大小的增长,性能会下降。在本文中,我们提出了OCTOPUS,这是一种在网格数据集上执行范围查询的策略,该范围在模拟过程中会发生不可预测的变化。在OCTOPUS中,我们利用关键洞察力,即网格表面和网格连接性足以有效地检索准确的查询结果。通过这种新颖的查询执行策略,OCTOPUS可以最大程度地减少索引维护成本并显着减少查询执行时间。我们的实验表明,与现有技术相比,OCTOPUS实现了7.3到9.2倍的加速,并且随着网格数据集大小和细节的增加,其缩放性更好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号