首页> 外文会议> >Parallel algorithms for executing join on cube-connected multicomputers
【24h】

Parallel algorithms for executing join on cube-connected multicomputers

机译:在多维数据集连接的多计算机上执行联接的并行算法

获取原文

摘要

The authors present parallel processing of database joins in a hypercube system based on a dynamic and order-preserving data partitioning storage organization referred to as DYOP. A DYOP file system corresponds to a grid-based file organization. A grid-based file is any file organization where the n-field (attribute) records of a file are represented as points in an n-dimensional space. Such a hyperspace is divided into a set of hyperrectangles, each of which corresponds to a disk block. In DYOP, values along each attribute are stored in an order-preserving fashion. As the file grows, its partitions are split along a dimension (attribute) by preserving the order of values. As the file growth continues, further splits are performed in such a way that each split occurs along a different attribute in a cyclic fashion. There have been two previous studies in implementing a database join operation on hypercubes. A performance comparison of these studies is presented.
机译:作者介绍了基于动态和保持顺序的数据分区存储组织(称为DYOP)的超多维数据集系统中数据库联接的并行处理。 DYOP文件系统对应于基于网格的文件组织。基于网格的文件是将文件的n字段(属性)记录表示为n维空间中的点的任何文件组织。这样的超空间被分为一组超矩形,每个超矩形对应于一个磁盘块。在DYOP中,沿每个属性的值以保留顺序的方式存储。随着文件的增长,其分区通过保留值的顺序沿维度(属性)进行拆分。随着文件增长的继续,将执行进一步的拆分,以使每个拆分都以循环方式沿着不同的属性发生。在超多维数据集上实现数据库联接操作之前,已有两项研究。提出了这些研究的性能比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号