首页> 外文期刊>Journal of Computers >An Efficient Encoding Scheme to Handle the Address Space Overflow for Large Multidimensional Arrays
【24h】

An Efficient Encoding Scheme to Handle the Address Space Overflow for Large Multidimensional Arrays

机译:一种有效的编码方案,用于处理大型多维数组的地址空间溢出

获取原文
           

摘要

—We present a new implementation scheme of multidimensional array for handling large scale high dimensional datasets that grows incrementally. The scheme implements a dynamic multidimensional extendible array employing a set of two dimensional extendible arrays. The multidimensional arrays provide many advantages but it has some problems as well. The Traditional Multidimensional array is not dynamic extendible. Again, if the length of dimension and number of dimension of a multidimensional array is large then the address space for the array overflows quickly. In this paper, we propose a solution against the essential problem of address space overflow for handling large scale multidimensional datasets using our implementation model. We also propose a record encoding scheme based on our model for representing relational tables using multidimensional array. We evaluate our proposed scheme by comparing with Traditional Multidimensional Array (TMA) for different operations and find a reasonable delay of address space overflow with no retrieval penalty. We also compare the encoded scheme with traditional scheme and find that proposed encoded scheme performs better on range retrieval for sparse array.
机译:- 我们介绍了用于处理逐步增长的大规模高维数据集的多维数组的新实现方案。该方案实现了采用一组二维扩展阵列的动态多维扩展阵列。多维阵列提供了许多优点,但它也存在一些问题。传统的多维阵列不是动态延伸的。同样,如果多维数组的维度和维数的长度大,则阵列的地址空间溢出。在本文中,我们提出了一种解决方案,用于使用我们的实现模型处理大规模多维数据集的地址空间溢出的基本问题。我们还基于我们的模型提出了一种基于模型的编码方案,用于使用多维数组表示关系表。我们通过与不同操作的传统多维阵列(TMA)与传统的多维阵列(TMA)进行评估,并找到合理的地址空间溢出延迟,没有检索罚款。我们还将编码方案与传统方案进行比较,并发现所提出的编码方案更好地对稀疏阵列进行范围检索进行更好地执行。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号