Method of performing a parallel relational database query in a
multiprocessor environment

    公开(公告)号:US5765146A

    公开(公告)日:1998-06-09

    申请号:US148769

    申请日:1993-11-04

    IPC分类号: G06F17/30

    摘要: 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.

    Progressive content-based retrieval of image and video with adaptive and
iterative refinement
    10.
    发明授权
    Progressive content-based retrieval of image and video with adaptive and iterative refinement 失效
    基于内容的基于内容的图像和视频检索,具有自适应和迭代细化

    公开(公告)号:US5734893A

    公开(公告)日:1998-03-31

    申请号:US535500

    申请日:1995-09-28

    IPC分类号: G06F17/30

    摘要: A method and apparatus for minimizing the time required to obtain results for a content based query in a data base. More specifically, with this invention, the data base is partitioned into a plurality of groups. Then, a schedule or sequence of groups is assigned to each of the operations of the query, where the schedule represents the order in which an operation of the query will be applied to the groups in the schedule. Each schedule is arranged so that each application of the operation operates on the group which will yield intermediate results that are closest to final results.

    摘要翻译: 一种用于最小化在数据库中获得基于内容的查询的结果所需的时间的方法和装置。 更具体地说,利用本发明,数据库被分成多个组。 然后,将分组的一个或多个序列分配给查询的每个操作,其中该调度表示该查询的操作将被应用于该调度中的组的顺序。 安排每个时间表,使得操作的每个应用操作在将产生最接近最终结果的中间结果的组上。