期刊文献+

SwiftArray: Accelerating Queries on Multidimensional Arrays

SwiftArray: Accelerating Queries on Multidimensional Arrays
原文传递
导出
摘要 Scientific instruments and simulation programs are generating large amounts of multidimensional array data. Queries with value and dimension subsetting conditions are commonly used by scientists to find useful information from big array data, and data storage and indexing methods play an important role in supporting queries on multidimensional array data efficiently. In this paper, we propose SwiftArray, a new storage layout with indexing techniques to accelerate queries with value and dimension subsetting conditions. In SwiftArray, the multidimensional array is divided into blocks and each block stores sorted values. Blocks are placed in the order of a Hilbert space-filling curve to improve data locality for dimension subsetting queries. We propose a 2-D-Bin method to build an index for the blocks' value ranges, which is an efficient way to avoid accessing unnecessary blocks for value subsetting queries. Our evaluations show that SwiftArray surpasses the NetCDF-4 format and FastBit indexing technique for queries on multidimensional arrays. Scientific instruments and simulation programs are generating large amounts of multidimensional array data. Queries with value and dimension subsetting conditions are commonly used by scientists to find useful information from big array data, and data storage and indexing methods play an important role in supporting queries on multidimensional array data efficiently. In this paper, we propose SwiftArray, a new storage layout with indexing techniques to accelerate queries with value and dimension subsetting conditions. In SwiftArray, the multidimensional array is divided into blocks and each block stores sorted values. Blocks are placed in the order of a Hilbert space-filling curve to improve data locality for dimension subsetting queries. We propose a 2-D-Bin method to build an index for the blocks' value ranges, which is an efficient way to avoid accessing unnecessary blocks for value subsetting queries. Our evaluations show that SwiftArray surpasses the NetCDF-4 format and FastBit indexing technique for queries on multidimensional arrays.
出处 《Tsinghua Science and Technology》 SCIE EI CAS 2014年第5期521-530,共10页 清华大学学报(自然科学版(英文版)
基金 supported in part by the Natural Science Foundation of China (No. 41375102) the National Key Basic Research and Development (973) Program of China (No. 2014CB347800) the National HighTech Research and Development Program (863) of China (No. 2011AA01A203)
关键词 multidimensional array INDEXING space-filling curve multidimensional array indexing space-filling curve
  • 相关文献

参考文献16

  • 1L.Evans,The large hadron collider,New J.Phys.,vol.9,no.9,p.335,Sep.2007.
  • 2K.E.Taylor,R.J.Stouffer,and G.A.Meehl,An overview of CMIP5 and the experiment design,Bulletin of the American Meteorological Society,vol.93,no.4,pp.485-498,Apr.2012.
  • 3R.Rew,E.Hartnett,and J.Caron,NetCDF-4:Software implementing an enhanced data model for the geosciences,in 22nd International Conference on Interactive Information Processing Systems for Meteorology,Oceanograph,and Hydrology,2006.
  • 4M.Folk,G.Heber,Q.Koziol,E.Pourmal,and D.Robison,An overview of the HDF5 technology suite and its applications,in Proceedings of the EDBT/ICDT 2011 Workshop on Array Databases,New York,NY,USA,2011,pp.36-47.
  • 5K.Wu,S.Ahern,E.W.Bethel,J.Chen,H.Childs,E.Cormier-Michel,C.Geddes,J.Gu,H.Hagen,B.Hamann,W.Koegler,J.Lauret,J.Meredith,P.Messmer,E.Otoo,V.Perevoztchikov,A.Poskanzer,Prabhat,O.Rbel,A.Shoshani,A.Sim,K.Stockinger,G.Weber,and W.-M.Zhang,FastBit:Interactively searching massive data,J.Phys.:Conf Ser.,vol.180,no.1,012053,Jul.2009.
  • 6L.Gosink,J.Shalf.K.Stockinger,K.Wu,and W.Bethel,HDF5-FastQuery:Accelerating complex queries on HDF datasets using fast bitmap indices,in 18th International Conference on Scientific and Statistical Database Management,2006,pp.149-158.
  • 7B.Moon,H.V.Jagadish,C.Faloutsos,and J.H.Saltz,Analysis of the clustering properties of the Hilbert spacefilling curve,IEEE Transactions on Knowledge and Data Engineering,vol.13,no.1,pp.124-141,2001.
  • 8J.K.Lawder,Calculation of mappings between one and n-dimensional values using the hilbert space-filling curve,Technical Report JL1/00 Birkbeck College,University of London,2000.
  • 9S.M.Griffies,A.Biastoch,C.Bning,F.Bryan,G.Danabasoglu,E.P.Chassignet,M.H.England,R.Gerdes,H.Haak,R.W.Hallberg,W.Hazeleger,J.Jungclaus,W.G.Large,G.Madec,A.Pirani,B.L.Samuels,M.Scheinert,A.S.Gupta,C.A.Severijns,H.L.Simmons,A.M.Treguier,M.Winton,S.Yeager,and J.Yin,Coordinated ocean-ice reference experiments (COREs),Ocean Modelling,vol.26,no.1-2,pp.1-46,2009.
  • 10J.L.Bentley,Multidimensional binary search trees used for associative searching,Commun.ACM,vol.18,no.9,pp.509-517,1975.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部