首页> 外文会议>2012 SC Companion: High Performance Computing, Networking, Storage and Analysis. >Using Chunked Extendible Array for Physical Storage of Scientific Datasets
【24h】

Using Chunked Extendible Array for Physical Storage of Scientific Datasets

机译:使用块状可扩展阵列进行科学数据集的物理存储

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

摘要

The data model found to be most appropriate for scientific databases is the emph{array-oriented data model.} This also forms the basis of storing and accessing the database onto and from physical storage. Such storage systems are exemplified by the hierarchical data format(HDF/HDF5), the network common data format (NetCDF) and recently the SciDB. Given that the array is mapped onto linear locations in a file, i.e., a representation of an array file, in either row-major or column-major order, a fundamental feature of the representation is that they should be allowed to grow to massively large sizes by gradual expansions of the array bounds. In both the row-major and column-major order of array elements, extendibility is allowed in one dimension only. We present an approach of storing multi-dimensional dense array on physical storage devices, that allows arbitrary extensions of any of the array bounds, without reorganising previously allocated array elements. For a $k$-dimensional $N$-element array, the organisation allows an element to be accessed in time $O(k + log N)$ using $O(k^2 N^{1/k})$ additional space. By chunking the array to size $N_c$ chunks, the time and space requirements reduce to $O(k + log N_c)$ and $O(k^2 N_c^{1/k}).$
机译:被发现最适合科学数据库的数据模型是emph {面向阵列的数据模型。}这也构成了在物理存储上以及从物理存储访问数据库的基础。这种存储系统以分层数据格式(HDF / HDF5),网络通用数据格式(NetCDF)和最近的SciDB为例。假定将数组映射到文件中的线性位置(即,以行为主或列为主的顺序的数组文件表示),则表示的基本特征是应允许它们增长到很大的大小通过逐步扩展数组范围来确定大小。在数组元素的行优先顺序和列优先顺序中,仅在一个维度中允许扩展。我们提出了一种在物理存储设备上存储多维密集数组的方法,该方法允许任意扩展数组边界,而无需重新组织先前分配的数组元素。对于$ k $维$ N $元素数组,组织允许使用$ O(k ^ 2 N ^ {1 / k})$另外的元素在$ O(k + log N)$的时间访问元素。空间。通过将数组分块为$ N_c $个块,时间和空间需求减少为$ O(k + log N_c)$和$ O(k ^ 2 N_c ^ {1 / k})。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号