会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method of performing a parallel relational database query in a
multiprocessor environment
    • 在多处理器环境中执行并行关系数据库查询的方法
    • US5797000A
    • 1998-08-18
    • US667056
    • 1996-06-20
    • Partha Pratim BhattacharyaJen-Yao ChungMir Hamid PiraheshPatricia G. SelingerMarisa S. ViverosYun WangLawrence Peter Zaino
    • Partha Pratim BhattacharyaJen-Yao ChungMir Hamid PiraheshPatricia G. SelingerMarisa S. ViverosYun WangLawrence Peter Zaino
    • G06F17/30
    • G06F17/30463G06F17/30445Y10S707/99932
    • A method of performing a parallel join operation on a pair of relations R1 and R2 in a system containing P processors organized into Q clusters of P/Q processors each. The system contains disk storage for each cluster, shared by the processors of that cluster, together with a shared intermediate memory (SIM) accessible by all processors. The relations R1 and R2 to be joined are first sorted on the join column. The underlying domain of the join column is then partitioned into P ranges of equal size. Each range is further divided into M subranges of progressively decreasing size to create MP tasks T.sub.m,p, the subranges of a given range being so sized relative to one another that the estimated completion time for task T.sub.m,p is a predetermined fraction that of task T.sub.m-1,p. Tasks T.sub.m,p with larger time estimates are assigned (and the corresponding tuples shipped) to the cluster to which processor p belongs, while tasks with smaller time estimates are assigned to the SIM, which is regarded as a universal cluster (cluster 0). The actual task-to-processor assignments are determined dynamically during the join phase in accordance with the dynamic longest processing time first (DLPT) algorithm. Each processor within a cluster picks its next task at any given decision point to be the one with the largest time estimate which is owned by that cluster or by cluster 0.
    • 在包含P个处理器的系统中对一对关系R1和R2执行并行连接操作的方法,所述P个处理器分组为Q个P / Q处理器群。 该系统包含每个集群的磁盘存储,由该集群的处理器共享,以及可由所有处理器访问的共享中间存储器(SIM)。 要连接的关系R1和R2首先在连接列上排序。 然后将连接列的基础域分成相同大小的P范围。 每个范围进一步分为逐渐减小的M个子范围以创建MP任务Tm,p,给定范围的子范围相对于彼此大小相对于任务Tm的估计完成时间,p是任务的预定分数 Tm-1,p。 将具有较大时间估计值的任务Tm,p(和相应的元组发货)分配给处理器p所属的集群,而具有较小时间估计的任务被分配给被认为是通用集群(集群0)的SIM。 根据动态最长处理时间优先(DLPT)算法,在连接阶段期间动态确定实际的任务到处理器分配。 集群内的每个处理器在任何给定的决策点选择其下一个任务,作为拥有该集群或集群0的最大时间估计值。