Patents by Inventor Daniel L. Gartung

Daniel L. Gartung 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).

  • Cross tab analysis and reporting method
    Patent number: 6321241
    Abstract: A method of and apparatus for preparing and modifying cross-tabulation analysis and reporting utilizes a data structure for storing aggregate data, gathered or input from a stream of data records. The data structure stores the aggregates of the data values, so that as cross-tab reports are generated, access to the original stream of data records is not necessary. Preferably, a tree-type data structure is utilized. The tree-type data structure is arranged relative to a root. The root of the tree is the first node in the tree. It has no parent node and no sibling nodes. Directly related to the root of the tree are labels of a first level. Labels of a second level and then labels of succeeding levels may follow, as required. Each level includes multiple nodes corresponding to the arrangement of the data. Each node has an array of accompanying cell in which the aggregates of the data values are stored.
    Type: Grant
    Filed: July 2, 1998
    Date of Patent: November 20, 2001
    Assignee: Brio Technology, Inc.
    Inventors: Daniel L. Gartung, Yorgen H. Edholm, Kay-Martin Edholm, Kristen N. McNall, Karl M. Lew
  • Cross tab analysis and reporting method
    Patent number: 5915257
    Abstract: A method of and apparatus for preparing and modifying cross-tabulation analysis and reporting utilizes a data structure for storing aggregate data, gathered or input from a stream of data records. The data structure stores the aggregates of the data values, so that as cross-tab reports are generated, access to the original stream of data records is not necessary. Preferably, a tree-type data structure is utilized. The tree-type data structure is arranged relative to a root. The root of the tree is the first node in the tree. It has no parent node and no sibling nodes. Directly related to the root of the tree are labels of a first level. Labels of a second level and then labels of succeeding levels may follow, as required. Each level includes multiple nodes corresponding to the arrangement of the data. Each node has an array of accompanying cell in which the aggregates of the data values are stored.
    Type: Grant
    Filed: December 24, 1996
    Date of Patent: June 22, 1999
    Assignee: Brio Technology, Inc.
    Inventors: Daniel L. Gartung, Yorgen H. Edholm, Kay-Martin Edholm, Kristen N. McNall, Karl M. Lew