OCTOPUS: Efficient Query Execution on Dynamic Mesh Datasets

被引:0
|
作者
Tauheed, Farhan [1 ,2 ]
Heinis, Thomas [1 ]
Schuermann, Felix [2 ]
Markram, Henry [2 ]
Ailamaki, Anastasia [1 ]
机构
[1] Ecole Polytech Fed Lausanne, Data Intens Applicat & Syst Lab, CH-1015 Lausanne, Switzerland
[2] Ecole Polytech Fed Lausanne, Brain Mind Inst, CH-1015 Lausanne, Switzerland
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.2x compared to the state of the art and that it scales better with increasing mesh dataset size and detail.
引用
收藏
页码:1000 / 1011
页数:12
相关论文
共 50 条
  • [1] Efficient Query Processing for Dynamically Changing Datasets
    Idris, Muhammad
    Ugarte, Martin
    Vansummeren, Stijn
    Voigt, Hannes
    Lehner, Wolfgang
    [J]. SIGMOD RECORD, 2019, 48 (01) : 33 - 40
  • [2] Efficient query execution on broadcasted index tree structures
    Hambrusch, Susanne
    Liu, Chuan-Ming
    Aref, Walid G.
    Prabhakar, Sunil
    [J]. DATA & KNOWLEDGE ENGINEERING, 2007, 60 (03) : 511 - 529
  • [3] Efficient Optimized Query Mesh for Data Streams
    Mohamed, Fatma
    Ismail, Rasha
    Badr, Nagwa
    Tolba, Mohamed Fahmy
    [J]. 2014 9TH INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING & SYSTEMS (ICCES), 2014, : 157 - 163
  • [4] Generating Power-Efficient Query Execution Plan
    Liu, Xiaowei
    Wang, Jinbao
    Wang, Haijie
    Gao, Hong
    [J]. PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER SCIENCE AND ENGINEERING (CSE 2013), 2013, 42 : 284 - 288
  • [5] NoDB: Efficient Query Execution on Raw Data Files
    Alagiannis, Ioannis
    Borovica-Gajic, Renata
    Branco, Miguel
    Idreos, Stratos
    Ailamaki, Anastasia
    [J]. COMMUNICATIONS OF THE ACM, 2015, 58 (12) : 112 - 121
  • [6] Generating custom code for efficient query execution on heterogeneous processors
    Sebastian Breß
    Bastian Köcher
    Henning Funke
    Steffen Zeuch
    Tilmann Rabl
    Volker Markl
    [J]. The VLDB Journal, 2018, 27 : 797 - 822
  • [7] Generating custom code for efficient query execution on heterogeneous processors
    Bress, Sebastian
    Koecher, Bastian
    Funke, Henning
    Zeuch, Steffen
    Rabl, Tilmann
    Markl, Volker
    [J]. VLDB JOURNAL, 2018, 27 (06): : 797 - 822
  • [9] Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets
    Shirani-Mehr, Houtan
    Banaei-Kashani, Farnoush
    Shahabi, Cyrus
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (09): : 848 - 859
  • [10] k-dominant Skyline query algorithm for dynamic datasets
    Zheng, Zhiyun
    Ruan, Ke
    Yu, Mengyao
    Zhang, Xingjin
    Wang, Ning
    Li, Dun
    [J]. FRONTIERS OF COMPUTER SCIENCE, 2021, 15 (01)