Parallel bottom-up construction of radix trees
    1.
    发明授权
    Parallel bottom-up construction of radix trees 失效
    平行自下而上建设的基数

    公开(公告)号:US5826262A

    公开(公告)日:1998-10-20

    申请号:US621757

    申请日:1996-03-22

    IPC分类号: G06F17/30

    摘要: A method for partitioning keys onto radix tree logical pages and a parallel index page build algorithm in order to provide radix tree build speedup proportional to the number of processors on the system and controlled efficient page utilization. Also, since keys are intelligently partitioned so that a complete set of keys is inserted into a logical page, there is no page overflow during the tree construction and thus page splitting is eliminated. Since radix index trees are really groups of logical pages in which each logical page contains a small tree, the tree is built (with respect to the logical pages) from the bottom up, while within each individual logical page the tree is constructed from the top down. The space required for a logical page is pre-allocated to allow construction of limbs to begin without waiting for the build of their underlying pages to complete.

    摘要翻译: 一种将键分解到基数树逻辑页面的方法和一个并行的索引页构建算法,以便提供与系统上的处理器数量成比例的基数树构建速度,并控制有效的页面利用率。 另外,由于密钥被智能地分割,使得一整套密钥被插入到逻辑页面中,所以在树构造期间没有页面溢出,因此页面拆分被消除。 由于基数索引树是真正的逻辑页面组,其中每个逻辑页面都包含一个小树,所以从底部向上构建树(相对于逻辑页面),而在每个单独的逻辑页面中,树从顶部构建 下。 逻辑页面所需的空间被预先分配,以允许构建四肢开始,而无需等待其底层页面的构建才能完成。

    Efficient processing of parent-child relationships in a relational database management system
    2.
    发明授权
    Efficient processing of parent-child relationships in a relational database management system 失效
    在关系数据库管理系统中有效处理父子关系

    公开(公告)号:US06456998B1

    公开(公告)日:2002-09-24

    申请号:US09164257

    申请日:1998-09-30

    IPC分类号: G06F1730

    摘要: A method, apparatus, article of manufacture, and data structure for efficiently identifying parent-child relationships of a plurality of members. The parent-child relationships are encoded into a matrix, wherein a particular member is represented by a particular row and a particular column of the matrix. A value at an intersection of a specific one of the rows and a specific one of the columns indicates whether a parent-child relationship exists between the member represented by the row and the member represented by the column. Thereafter, matrix operations may be applied to the matrix.

    摘要翻译: 一种用于有效地识别多个成员的父子关系的方法,装置,制品和数据结构。 父子关系被编码为矩阵,其中特定成员由矩阵的特定行和特定列表示。 特定行之间的交叉点和特定列之间的值表示在该行所表示的构件与由该列表示的构件之间是否存在父子关系。 此后,矩阵运算可以应用于矩阵。

    Method and system for efficiently searching an encoded vector index
    3.
    发明授权
    Method and system for efficiently searching an encoded vector index 失效
    用于有效搜索编码矢量索引的方法和系统

    公开(公告)号:US06285994B1

    公开(公告)日:2001-09-04

    申请号:US09318691

    申请日:1999-05-25

    IPC分类号: G06F1730

    摘要: Method and system aspects for efficiently searching an encoded vector index are provided. The aspects include the translation of a search query into a candidate bitmap, and the mapping of data from the candidate bitmap into a search result bitmap according to entry values in the encoded vector index. Further, the translation includes the setting of a bit in the candidate bitmap for each entry in a symbol table that corresponds to candidate of the search query. Also included in the mapping is the identification of a bit value in the candidate bitmap pointed to by an entry in an encoded vector.

    摘要翻译: 提供了有效搜索编码矢量索引的方法和系统方面。 这些方面包括将搜索查询翻译成候选位图,以及根据编码矢量索引中的条目值将数据从候选位图映射到搜索结果位图。 此外,翻译包括对于与搜索查询的候选者相对应的符号表中的每个条目的候选位图中的位的设置。 还包括在映射中的是识别由编码向量中的条目指向的候选位图中的位值。