利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

5 条记录 (耗时 0.012 秒)

    Method, apparatus and program storage device for determining an optimal number of tasks during reorganization of a database system with memory and processor constraints
    3.
    发明授权
    Method, apparatus and program storage device for determining an optimal number of tasks during reorganization of a database system with memory and processor constraints 有权
    用于在具有存储器和处理器约束的数据库系统重组期间确定最佳任务数量的方法，装置和程序存储装置

    公开(公告)号：US07752612B2

    公开(公告)日：2010-07-06

    申请号：US11047955

    申请日：2005-01-31

    申请人： Arnold T. Banzon ,  Craig A. Friske ,  John M. Garth ,  Ka C. Ng ,  James A. Ruddy ,  Bituin B. Vizconde

    发明人： Arnold T. Banzon ,  Craig A. Friske ,  John M. Garth ,  Ka C. Ng ,  James A. Ruddy ,  Bituin B. Vizconde

    IPC分类号： G06F9/45 ,  G06F9/46 ,  G06F12/00

    CPC分类号： G06F9/5066

    摘要： A method, apparatus and program storage device for determining an optimal number of tasks during reorganization of a database system with memory and processor constraints. The reorganization system identifies memory constraints, identifies processing capabilities and determines a number of reorganization processes and a combination of reorganization processes that provides a minimum reorganization time based upon the identified memory and processing constraints. The identified memory and processing capabilities identify a domain representing a set of rules applicable to the identified memory and processing capabilities. The set of rules of the identified domain are applied to determine an optimal number and combination of reorganization processes that minimizes a reorganization time.

    摘要翻译： 一种用于在具有存储器和处理器约束的数据库系统重组期间确定任务的最佳数量的方法，装置和程序存储装置。 重组系统识别内存约束，识别处理能力，并确定重组过程的数量以及根据所识别的内存和处理约束提供最小重组时间的重组流程的组合。 所识别的存储器和处理能力标识表示适用于所识别的存储器和处理能力的一组规则的域。 应用所识别域的一组规则来确定最小化重组时间的最优数量和重组过程的组合。

    Method and system for adaptively building a static Ziv-Lempel dictionary for database compression
    4.
    发明授权
    Method and system for adaptively building a static Ziv-Lempel dictionary for database compression 失效
    用于自适应构建静态Ziv-Lempel字典进行数据库压缩的方法和系统

    公开(公告)号：US5412384A

    公开(公告)日：1995-05-02

    申请号：US288675

    申请日：1994-08-10

    申请人： Chung-Chia Chang ,  Gregory L. Davoll ,  Mohamed H. El-Ruby ,  Craig A. Friske ,  Balakrishna R. Iyer ,  John P. Lazarus ,  David Wilhite ,  Kenneth E. Plambeck

    发明人： Chung-Chia Chang ,  Gregory L. Davoll ,  Mohamed H. El-Ruby ,  Craig A. Friske ,  Balakrishna R. Iyer ,  John P. Lazarus ,  David Wilhite ,  Kenneth E. Plambeck

    IPC分类号： G06F5/00 ,  G06T9/00 ,  H03M7/30 ,  H03M7/46 ,  H03M7/38

    CPC分类号： H03M7/3088 ,  G06T9/005

    摘要： A system for creating a static data compression dictionary adapted to a hardware-based data compression architecture. A static Ziv-Lempel dictionary is created and stored in memory for use in compressing database records. No data compression occurs during dictionary construction. A fixed-size Ziv-Lempel parse-tree is adapted to database characteristics in one of two alternate ways. First, the parse-tree is overbuilt substantially and then pruned back to a static size by eliminating the least recently used (LRU) nodes having the lowest use count. Alternatively, the parse-tree is built to a static size and thereafter selected nodes are replaced with new nodes upon database sampling. This node recycling procedure chooses the least-useful nodes for replacement according to a use count and LRU strategy while exhausting the database sample. The pruned Ziv-Lempel parse-tree is then transformed to a static dictionary configuration and stored in memory for use in a hardware-based database compression procedure. Completion of the static dictionary before starting data compression eliminates the initial compression inefficiencies well-known for the Ziv-Lempel procedure. The parse-tree construction is enhanced by initializing the tree with NULL and DEFAULT sequences from database definitions before examining any data.

    摘要翻译： 一种用于创建适用于基于硬件的数据压缩架构的静态数据压缩字典的系统。 静态Ziv-Lempel字典被创建并存储在内存中用于压缩数据库记录。 字典构造期间不发生数据压缩。 固定大小的Ziv-Lempel解析树以两种备选方式之一适用于数据库特征。 首先，解析树被大量覆盖，然后通过消除具有最低使用次数的最近最少使用的（LRU）节点将其修剪回静态大小。 或者，解析树被构建为静态大小，此后在数据库采样时，所选择的节点被新节点替换。 该节点回收过程根据使用次数和LRU策略选择最不利的节点进行替换，同时耗尽数据库样本。 修剪后的Ziv-Lempel解析树然后转换为静态字典配置，并存储在内存中，用于基于硬件的数据库压缩过程。 开始数据压缩之前完成静态字典消除了Ziv-Lempel过程众所周知的初始压缩效率低下。 在检查任何数据之前，通过从数据库定义中初始化具有NULL和DEFAULT序列的树来增强解析树结构。