Efficient processing of parent-child relationships in a relational database management system
    31.
    发明授权
    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.

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

    Using object relational extensions for mining association rules
    32.
    发明授权
    Using object relational extensions for mining association rules 有权
    使用对象关系扩展来挖掘关联规则

    公开(公告)号:US06301575B1

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

    申请号:US09191424

    申请日:1998-11-12

    IPC分类号: G06F1730

    摘要: A method, apparatus, and article of manufacture for computer-implemented use of object relational extensions for mining association rules. Data mining is performed by a computer to retrieve data from a data store stored on a data storage device coupled to the computer. A multi-column data store organized using a multi-column data model is received. One of the columns in the multi-column data store represents a transaction, and each of the remaining columns in the multi-column data store represents elements of that transaction. A combination operator is performed to obtain candidate itemsets of data from the multi-column data store, each itemset being a combination of a number of rows of the multi-column data store. Large itemsets of data are generated from the candidate itemsets, wherein each itemset has at least a minimum support. Association rules are generated from the large itemsets of data, wherein each association rule has at least a minimum confidence.

    摘要翻译: 用于采矿关联规则的对象关系扩展的计算机实现使用的方法,装置和制品。 数据挖掘由计算机执行以从存储在耦合到计算机的数据存储设备上的数据存储器中检索数据。 接收使用多列数据模型组织的多列数据存储。 多列数据存储中的列之一表示事务,多列数据存储中的其余列表示该事务的元素。 执行组合运算符以从多列数据存储获得数据的候选项集,每个项集是多列数据存储的多行的组合。 从候选项集中生成大量数据项,其中每个项集具有至少最小支持。 关联规则是从大量数据集生成的,其中每个关联规则具有至少最小的置信度。

    Dimension reduction for data mining application
    33.
    发明授权
    Dimension reduction for data mining application 失效
    数据挖掘应用的维度减少

    公开(公告)号:US6032146A

    公开(公告)日:2000-02-29

    申请号:US21038

    申请日:1998-02-09

    IPC分类号: G06F17/30

    摘要: A method, apparatus, and article of manufacture for a computer-implemented random reliability engine for computer-implemented dimension reduction using association rules for data mining application. The data mining is performed by the computer to retrieve data from a data store stored on a data storage device coupled to the computer. The data store has records that have multiple attributes. The multiple attributes of a table are clustered to produce a plurality of sets of attributes. Each set of attributes is clustered to obtain data mining attributes.

    摘要翻译: 一种用于计算机实现的随机可靠性引擎的方法,装置和制品,其使用用于数据挖掘应用的关联规则进行计算机实现的维度缩减。 数据挖掘由计算机执行以从存储在耦合到计算机的数据存储设备上的数据存储器中检索数据。 数据存储具有多个属性的记录。 表的多个属性被聚集以产生多组属性。 将每组属性聚类以获取数据挖掘属性。

    Encoded-vector indices for decision support and warehousing
    35.
    发明授权
    Encoded-vector indices for decision support and warehousing 失效
    用于决策支持和仓储的编码向量索引

    公开(公告)号:US5706495A

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

    申请号:US643998

    申请日:1996-05-07

    IPC分类号: G06F17/30

    摘要: A method, apparatus, and article of manufacture for optimizing SQL queries in a relational database management system using a vectorized index. The vectorized index represents values in one or more of the columns of a particular table in the relational database. The vectorized index is comprised of a plurality of positions, wherein each of the positions comprises a linear array that represents a value for the specified columns in a corresponding row of the particular table in the relational database. To use the vectorized index, SQL operations are converted to a series of bit-vector operations on that index, where the result of the bit-vector operations is a list of row positions in the table.

    摘要翻译: 一种使用向量化索引在关系数据库管理系统中优化SQL查询的方法,设备和制品。 向量化索引表示关系数据库中特定表的一个或多个列中的值。 矢量化索引由多个位置组成,其中每个位置包括线性阵列,其表示关系数据库中特定表的对应行中的指定列的值。 要使用向量化索引,SQL操作将转换为该索引上的一系列位向量操作,其中位向量操作的结果是表中的行位列表。

    Method for a CPU to utilize a parallel instruction execution processing
facility for assisting in the processing of the accessed data
    36.
    发明授权
    Method for a CPU to utilize a parallel instruction execution processing facility for assisting in the processing of the accessed data 失效
    用于CPU利用并行指令执行处理设施来协助处理所访问数据的方法

    公开(公告)号:US5706489A

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

    申请号:US544496

    申请日:1995-10-18

    IPC分类号: G06F9/38

    摘要: A method for obtaining parallel instruction execution (PIE) for frequently used programming operations, such as database record compression or expansion, cryptographic encoding/decoding, page moving, etc., for which a hardware-assist may be provided. These functions can be performed in parallel with CPU processing by a PIE processing facility (PIE-PF). The method is hardware/microcode based and uses software control in supervisory mode. The preferred embodiment is controlled by privileged subsystem software under an operating system, and does not use I/O channel oriented off-load processing. When the CPU is interrupted during an incomplete parallel operation by the PIE-PF, it is checkpointed in main storage in a manner accessible to the subsystem. The subsystem (after completing a current CPU operation, such as a database record predicate evaluation, can check for the completion of the PIE-PF operation by examining an indicator in a control block in shared storage. Furthermore, if the parallel operation has not completed, the CPU can: a) continue the PIE-PF processing in parallel with other processing in the CPU, b) halt the parallel PIE-PF asynchronous operation and have the CPU do the rest of the operation synchronously, or c) resume the parallel operation in the processor or a hardware assist if an interruption caused the PIE-PF parallel operation to be checkpointed.

    摘要翻译: 用于获得可以提供硬件辅助的频繁使用的编程操作(诸如数据库记录压缩或扩展,加密编码/解码,页面移动等)的并行指令执行(PIE)的方法。 这些功能可以与PIE处理设备(PIE-PF)的CPU处理并行执行。 该方法是基于硬件/微代码,并以监控模式使用软件控制。 优选实施例由操作系统下的特权子系统软件控制,并且不使用I / O通道定向的卸载处理。 当CPU在PIE-PF的不完全并行操作期间中断时,它将以子系统可访问的方式在主存储中进行检查。 子系统(完成目前的CPU操作,如数据库记录谓词评估)可以通过检查共享存储器中的控制块中的指示符来检查PIE-PF操作的完成情况,此外,如果并行操作未完成 CPU可以:a)与CPU中的其他处理并行执行PIE-PF处理,b)停止并行PIE-PF异步操作,并让CPU同步执行其余操作,或c)恢复并行 如果中断导致PIE-PF并行操作被检查点,则处理器中的操作或硬件辅助。

    Coexecution processor isolation using an isolation process or having
authority controls for accessing system main storage
    37.
    发明授权
    Coexecution processor isolation using an isolation process or having authority controls for accessing system main storage 失效
    使用隔离进程执行处理器隔离或具有访问系统主存储的权限控制

    公开(公告)号:US5655146A

    公开(公告)日:1997-08-05

    申请号:US680069

    申请日:1996-07-12

    摘要: A coexecutor for executing functions offloaded from central processors (CPs) in a data processing system, as requested by one or more executing control programs, which include a host operating system (host OS), and subsystem programs and applications executing under the host OS. The offloaded functions are embodied in code modules. Code modules execute in the coexecutor in parallel with non-offloaded functions being executed by the CPs. Thus, the CPs do not need to execute functions which can be executed by the coexecutor. CP requests to the coexecutor specify the code modules which are accessed by the coexecutor from host shared storage under the same constraints and access limitations as the control programs. The coexecutor may emulate host dynamic address translation, and may use a provided host storage key in accessing host storage. The restricted access operating state for the coexecutor maintains data integrity. Coexecutors can be of the same architecture or of a totally different architecture from the CPs to provide an efficient processing environment for the offloaded functions. The coexecutor interfaces host software which provides the requests to the coexecutor. Offloaded modules, once accessed by the coexecutor, may be cached in coexecutor local storage for use by future requests to allow subsequent invocations to proceed without waiting to again load the same module.

    摘要翻译: 用于执行由数据处理系统中的中央处理器(CP)卸载的执行器,如由一个或多个执行控制程序请求的,其包括主机操作系统(主机OS)以及在主机OS下执行的子系统程序和应用程序。 卸载的功能体现在代码模块中。 代码模块在执行程序中执行,与CP执行的非卸载函数并行执行。 因此,CP不需要执行可由coexecutor执行的功能。 向请求者执行的CP请求在与控制程序相同的约束和访问限制下指定由主机共享存储器由coexecutor访问的代码模块。 共同执行者可以模拟主机动态地址转换,并且可以使用提供的主机存储密钥来访问主机存储。 coexecutor的受限访问操作状态维护数据完整性。 共同执行者可以是与CP相同的架构或与CP完全不同的架构,为卸载的功能提供有效的处理环境。 接口主机将向主机提供请求的主机软件。 卸载的模块一旦被coexecutor访问,就可以被缓存在coexecutor本地存储器中,供将来的请求使用,以允许后续的调用继续进行,而不用等待再次加载相同的模块。

    Method and system for creating an in-memory physical dictionary for data compression
    40.
    发明授权
    Method and system for creating an in-memory physical dictionary for data compression 有权
    用于创建用于数据压缩的内存中物理字典的方法和系统

    公开(公告)号:US07973680B2

    公开(公告)日:2011-07-05

    申请号:US12172557

    申请日:2008-07-14

    IPC分类号: H03M7/34

    CPC分类号: H03M7/3088

    摘要: A system and computer readable storage medium for creating an in-memory physical dictionary for data compression are provided. A new heuristic is defined for converting each of a plurality of logical nodes into a corresponding physical node forming a plurality of physical nodes. Each of the physical nodes are placed into the physical dictionary while traversing the dictionary tree in descending visit count order. Each physical node is placed in its nearest ascendant's cache-line with sufficient space. If there is no space in any of the ascendant's cache-line, then the physical node is placed into a new cache-line, unless a pre-defined packing threshold has been reached, in which case the physical node is placed in the first available cache-line.

    摘要翻译: 提供了一种用于创建用于数据压缩的内存中物理字典的系统和计算机可读存储介质。 定义了一种新的启发式算法,用于将多个逻辑节点中的每一个转换成形成多个物理节点的对应物理节点。 每个物理节点都以递减的访问次序顺序遍历字典树,放入物理字典。 每个物理节点都放置在其最接近的上升缓存行,并具有足够的空间。 如果任何上升缓存行中没有空格,则物理节点将被放置到新的高速缓存行中,除非已达到预定义的打包阈值,在这种情况下,物理节点被置于第一个可用的 缓存线。