Patents by Inventor Gregory L. Davoll

Gregory L. Davoll has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Method and system for adaptively building a static Ziv-Lempel dictionary for database compression
    Patent number: 5534861
    Abstract: 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.
    Type: Grant
    Filed: March 8, 1995
    Date of Patent: July 9, 1996
    Assignee: International Business Machines Corporation
    Inventors: Chung-Chia Chang, Gregory L. Davoll, Mohamed H. El-Ruby, Craig A. Friske, Balakrishna R. Iyer, John P. Lazarus, David Wilhite, Kenneth E. Plambeck
  • Method and system for adaptively building a static Ziv-Lempel dictionary for database compression
    Patent number: 5412384
    Abstract: 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.
    Type: Grant
    Filed: August 10, 1994
    Date of Patent: May 2, 1995
    Assignee: International Business Machines Corporation
    Inventors: Chung-Chia Chang, Gregory L. Davoll, Mohamed H. El-Ruby, Craig A. Friske, Balakrishna R. Iyer, John P. Lazarus, David Wilhite, Kenneth E. Plambeck