Patents by Inventor Matt Hogstrom

Matt Hogstrom 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).

  • Patent number: 11636090
    Abstract: A computer-implemented method, system, and non-transitory machine readable medium for a graph-based analysis for an Information Technology (IT) operations includes generating a temporal graph by extracting one or more of operation objects, relations and attributes from operation data of workloads distributed across a plurality of levels of the IT operation within a predetermined time window. Anomalies are detected from the extracted operation data and annotating corresponding objects in the graph. A directional impact between corresponding objects on the temporal graph is determined, and the temporal graph is refined based on the determined directional impact. Accessible paths in the temporal graph indicating error propagation are searched, and potential causes for the detected anomalies in the temporal graph are identified. A list of the potential causes of the anomalies is generated, and a root cause ranked for each of the corresponding objects in the temporal graph.
    Type: Grant
    Filed: March 15, 2020
    Date of Patent: April 25, 2023
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jia Qi Li, Fan Jing Meng, Pei Ni Liu, Zi Xiao Zhu, Matt Hogstrom, Dong Sheng Li
  • Publication number: 20210286798
    Abstract: A computer-implemented method, system, and non-transitory machine readable medium for a graph-based analysis for an Information Technology (IT) operations includes generating a temporal graph by extracting one or more of operation objects, relations and attributes from operation data of workloads distributed across a plurality of levels of the IT operation within a predetermined time window. Anomalies are detected from the extracted operation data and annotating corresponding objects in the graph. A directional impact between corresponding objects on the temporal graph is determined, and the temporal graph is refined based on the determined directional impact. Accessible paths in the temporal graph indicating error propagation are searched, and potential causes for the detected anomalies in the temporal graph are identified. A list of the potential causes of the anomalies is generated, and a root cause ranked for each of the corresponding objects in the temporal graph.
    Type: Application
    Filed: March 15, 2020
    Publication date: September 16, 2021
    Inventors: Jia Qi Li, Fan Jing Meng, Pei Ni Liu, Zi Xiao Zhu, Matt Hogstrom, Dong Sheng Li
  • Publication number: 20200364104
    Abstract: In one example implementation according to aspects of the present disclosure, a computer-implemented method includes training, by a processing device, a log sequence model based at least in part on training log messages. The method further includes integrating, by the processing device, a system-level model and a component-level model to detect a relationship or an anomaly. The method further includes identify, by the processing device, a workflow as a directed graph. The method further includes matching, by the processing device, the workflow to a system configuration graph. The method further includes identifying, by the processing device, a problem based at least in part on one or more of the system configuration graph and results of the matching of the workflow and the system configuration graph.
    Type: Application
    Filed: May 17, 2019
    Publication date: November 19, 2020
    Inventors: Yuk L. Chan, Lei Yu, Qi Zhang, Hong Min, Santiago Ortega, Matt Hogstrom, Bradford Austin Fisher
  • Publication number: 20060294088
    Abstract: The present invention provides a method, system, and computer program product for caching dynamically generated queries such as SQL (Structured Query Language) statements. A method in accordance with an embodiment of the present invention comprises: providing a partial update query for updating at least one column in a table stored in a database; generating a key using a number representative of an update status of each column in the table; and determining if a prepared statement corresponding to the partial update query is located in a prepared statement cache using the key.
    Type: Application
    Filed: June 27, 2005
    Publication date: December 28, 2006
    Applicant: International Business Machines Corporation
    Inventors: John Stecher, Soloman Barghouthi, Matt Hogstrom, Yang Lei, Andrew Spyker, Robert Wisniewski
  • Publication number: 20060230019
    Abstract: A method, apparatus, and computer program product in a data processing system for avoiding excessive database round trips. A list of a database object fields affected by queries is compiled by analyzing instructions in a database query language. A list of database object fields affected by queries is also compiled by analyzing database object relationships. Using the combined list of affected database object fields, when a find operation is invoked, a determination is made as to whether the affected database object fields have been modified. Next, if the affected database object fields have been modified, database updates are generated for the affected database objects containing the affected database object fields. After that, the database updates are executed after all affected database object fields have been processed. Finally, the queries are submitted.
    Type: Application
    Filed: April 8, 2005
    Publication date: October 12, 2006
    Applicant: International Business Machines Corporation
    Inventors: Justin Hill, Matt Hogstrom, Yang Lei, Harry Nayak
  • Publication number: 20060031834
    Abstract: A method, apparatus, system, and signal-bearing medium that, in an embodiment, identify a component that initiates a transaction in an application, calculate a set of persistent objects potentially enlisted by the transaction, and calculate a set of potential operations that the transaction may perform with respect to each of the potentially enlisted persistent objects. The transaction is then optimized based on a configuration, where the configuration is based on the set of potential operations that the transaction may perform with respect to each of the potentially enlisted persistent objects. If a single invocation of the component initiates more than one transaction, actions taken by the set of persistent objects are collapsed into a collapsed set, and policies relevant to the collapsed set are associated with a unique task name.
    Type: Application
    Filed: August 5, 2004
    Publication date: February 9, 2006
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Mercer Colby, Stephen Fink, Matt Hogstrom
  • Publication number: 20050223028
    Abstract: A method, system and apparatus for configuring programmatic objects for cache co-location. The method can include the steps of counting a frequency of access for individual fields in the object in a static analysis, rearranging the fields in the object based upon the counted frequency in the static analysis, and executing the object. Subsequently, a frequency of access for the individual fields in the object further can be counted in a dynamic analysis. Consequently, the fields in the object can be further rearranged based upon the counted frequency in the dynamic analysis to produce an optimal grouping for placement in cache memory. In a preferred aspect of the invention, access types for the individual fields can be identified. Subsequently, the rearranging step and the further rearranging step can be performed based both upon the counted frequency and also upon the access types.
    Type: Application
    Filed: April 5, 2004
    Publication date: October 6, 2005
    Applicant: International Business Machines Corporation
    Inventors: Robert Geiner, Matt Hogstrom
  • Publication number: 20050091322
    Abstract: An improved solution for communicating over a network. In particular, a set of rules is defined on a server and provided to a client. The set of rules on the client can be periodically synchronized with the set of rules on the server. The client uses the set of rules to classify messages before they are sent to the server. The server can separately monitor for messages having a particular message classification and can process the messages accordingly. As a result, messages are classified on a client while maintaining the flexibility to change message classifications on the server.
    Type: Application
    Filed: October 27, 2003
    Publication date: April 28, 2005
    Applicant: International Business Machines Corporation
    Inventors: Matt Hogstrom, Anthony Tuel