Patents by Inventor Mark J. Addleman

Mark J. Addleman 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: 9460173
    Abstract: A method includes identifying a first set of metadata associated with a database and retrieving the first set of metadata from one or more first memory locations. The method also includes identifying, based on the first set of metadata, a second set of metadata associated with the database and retrieving the second set of metadata from one or more second memory locations. The method further includes combining the first set of metadata and the second set of metadata into a set of combined metadata.
    Type: Grant
    Filed: November 28, 2011
    Date of Patent: October 4, 2016
    Assignee: CA, Inc.
    Inventors: Howard A. Abrams, Mark J. Addleman, Jay M. Cohen
  • Patent number: 8977646
    Abstract: A method includes receiving a database query for a first database and determining whether a second database contains data responsive to the database query, wherein the second database comprises a graph database. The method also includes retrieving responsive data from a memory device associated with the second database if it is determined that the second database contains data responsive to the database query. The method further includes responding to the database query by providing the responsive data.
    Type: Grant
    Filed: June 14, 2012
    Date of Patent: March 10, 2015
    Assignee: CA, Inc.
    Inventors: Howard A. Abrams, Mark J. Addleman
  • Publication number: 20130339385
    Abstract: A method includes receiving a database query for a first database and determining whether a second database contains data responsive to the database query, wherein the second database comprises a graph database. The method also includes retrieving responsive data from a memory device associated with the second database if it is determined that the second database contains data responsive to the database query. The method further includes responding to the database query by providing the responsive data.
    Type: Application
    Filed: June 14, 2012
    Publication date: December 19, 2013
    Applicant: CA, Inc.
    Inventors: Howard A. Abrams, Mark J. Addleman
  • Publication number: 20130138681
    Abstract: A method includes identifying a first set of metadata associated with a database and retrieving the first set of metadata from one or more first memory locations. The method also includes identifying, based on the first set of metadata, a second set of metadata associated with the database and retrieving the second set of metadata from one or more second memory locations. The method further includes combining the first set of metadata and the second set of metadata into a set of combined metadata.
    Type: Application
    Filed: November 28, 2011
    Publication date: May 30, 2013
    Applicant: COMPUTER ASSOCIATES THINK, INC.
    Inventors: Howard A. Abrams, Mark J. Addleman, Jay M. Cohen
  • Patent number: 8078619
    Abstract: Messages which are provided to an application are monitored. Similarities between the messages are determined based on a distance algorithm, in one approach, and messages which are similar are assigned to a common group. For example, the messages may be HTTP messages which include a URL, HTTP header parameters and/or HTTP post parameters. The messages are parsed to derive a string which is used in the distance calculations. Additionally, application runtime data such as response times is obtained and aggregated for the group. Further, a representative message can be determined for each group for comparison to subsequent messages. Results can be reported which include a group identifier, representative message, count and aggregated runtime data.
    Type: Grant
    Filed: March 12, 2010
    Date of Patent: December 13, 2011
    Assignee: Computer Associates Think, Inc.
    Inventors: Jyoti Kumar Bansal, David Isaiah Seidman, Mark J. Addleman
  • Patent number: 7917911
    Abstract: An application is monitored to identify different execution paths, e.g., sequences of invoked components, which occur due to the receipt of messages by the application. Similarities between the execution paths are determined based on a distance algorithm, in one approach, and execution paths which are similar are assigned to a common group. Additionally, application runtime data such as response times is obtained for the execution paths and aggregated for the group. The messages can also be grouped based on the grouping of the execution paths. Further, a representative execution path can be determined for each execution path group for comparison to subsequent execution paths. A representative message can similarly be determined for each message group. Results can be reported which include a group identifier, representative message, representative execution path, count, and aggregated runtime data.
    Type: Grant
    Filed: December 1, 2006
    Date of Patent: March 29, 2011
    Assignee: Computer Associates Think, Inc.
    Inventors: Jyoti Kumar Bansal, David Isaiah Seidman, Mark J. Addleman
  • Patent number: 7761487
    Abstract: A near out-of-memory condition in a memory space is detected by creating softly reachable objects which are garbage collected when the memory space is becoming full. The softly reachable objects are objects that can be cleared at the discretion of the garbage collector when heap memory is running low. An agent process of an application can create soft reference objects which reference the softly reachable objects, and periodically poll the soft reference objects to determine if the softly reachable objects have been cleared. If they have been cleared, the agent reports to the application so that a graceful shutdown of the application can be initiated. A report can also be sent to a user interface or other output device. Additional information regarding the memory space can be gained by using softly reachable objects of different sizes and/or ages. Further, a wait period for the polling can be set adaptively.
    Type: Grant
    Filed: December 13, 2006
    Date of Patent: July 20, 2010
    Assignee: Computer Associates Think, Inc.
    Inventors: Jyoti Kumar Bansal, David Isaiah Seidman, Mark J. Addleman
  • Publication number: 20100169285
    Abstract: Messages which are provided to an application are monitored. Similarities between the messages are determined based on a distance algorithm, in one approach, and messages which are similar are assigned to a common group. For example, the messages may be HTTP messages which include a URL, HTTP header parameters and/or HTTP post parameters. The messages are parsed to derive a string which is used in the distance calculations. Additionally, application runtime data such as response times is obtained and aggregated for the group. Further, a representative message can be determined for each group for comparison to subsequent messages. Results can be reported which include a group identifier, representative message, count and aggregated runtime data.
    Type: Application
    Filed: March 12, 2010
    Publication date: July 1, 2010
    Applicant: COMPUTER ASSOCIATES THINK, INC.
    Inventors: Jyoti Kumar Bansal, David Isaiah Seidman, Mark J. Addleman
  • Patent number: 7689610
    Abstract: Messages which are provided to an application are monitored. Similarities between the messages are determined based on a distance algorithm, in one approach, and messages which are similar are assigned to a common group. For example, the messages may be HTTP messages which include a URL, HTTP header parameters and/or HTTP post parameters. The messages are parsed to derive a string which is used in the distance calculations. Additionally, application runtime data such as response times is obtained and aggregated for the group. Further, a representative message can be determined for each group for comparison to subsequent messages. Results can be reported which include a group identifier, representative message, count and aggregated runtime data.
    Type: Grant
    Filed: December 1, 2006
    Date of Patent: March 30, 2010
    Assignee: Computer Associates Think, Inc.
    Inventors: Jyoti Kumar Bansal, David Isaiah Seidman, Mark J. Addleman
  • Patent number: 7634590
    Abstract: Resource pool depletion information, including the estimated time until the resource pool is depleted, is derived from resource pool data. Data regarding the size of a resource pool is collected over a period of time. The data may include the resource pool size and other information. One or more functions are then generated to fit one or more sets of data within the collected resource pool data. The best fitting function is selected from the generated functions and used to determine the time at which the particular resource pool will become depleted. Values for the selected function can be generated at future points in time to determine the depletion point of the resource pool. The time information as well as depletion confidence values are provided to a user or otherwise processed.
    Type: Grant
    Filed: November 8, 2005
    Date of Patent: December 15, 2009
    Assignee: Computer Associates Think, Inc.
    Inventors: Mark J. Addleman, John Bley, Brian Zuzga
  • Publication number: 20080147705
    Abstract: A near out-of-memory condition in a memory space is detected by creating softly reachable objects which are garbage collected when the memory space is becoming full. The softly reachable objects are objects that can be cleared at the discretion of the garbage collector when heap memory is running low. An agent process of an application can create soft reference objects which reference the softly reachable objects, and periodically poll the soft reference objects to determine if the softly reachable objects have been cleared. If they have been cleared, the agent reports to the application so that a graceful shutdown of the application can be initiated. A report can also be sent to a user interface or other output device. Additional information regarding the memory space can be gained by using softly reachable objects of different sizes and/or ages. Further, a wait period for the polling can be set adaptively.
    Type: Application
    Filed: December 13, 2006
    Publication date: June 19, 2008
    Applicant: COMPUTER ASSOCIATES THINK, INC.
    Inventors: Jyoti Kumar Bansal, David Isaiah Seidman, Mark J. Addleman
  • Publication number: 20080134209
    Abstract: Messages which are provided to an application are monitored. Similarities between the messages are determined based on a distance algorithm, in one approach, and messages which are similar are assigned to a common group. For example, the messages may be HTTP messages which include a URL, HTTP header parameters and/or HTTP post parameters. The messages are parsed to derive a string which is used in the distance calculations. Additionally, application runtime data such as response times is obtained and aggregated for the group. Further, a representative message can be determined for each group for comparison to subsequent messages. Results can be reported which include a group identifier, representative message, count and aggregated runtime data.
    Type: Application
    Filed: December 1, 2006
    Publication date: June 5, 2008
    Applicant: COMPUTER ASSOCIATES THINK, INC.
    Inventors: Jyoti Kumar Bansal, David Isaiah Seidman, Mark J. Addleman
  • Publication number: 20080134205
    Abstract: An application is monitored to identify different execution paths, e.g., sequences of invoked components, which occur due to the receipt of messages by the application. Similarities between the execution paths are determined based on a distance algorithm, in one approach, and execution paths which are similar are assigned to a common group. Additionally, application runtime data such as response times is obtained for the execution paths and aggregated for the group. The messages can also be grouped based on the grouping of the execution paths. Further, a representative execution path can be determined for each execution path group for comparison to subsequent execution paths. A representative message can similarly be determined for each message group. Results can be reported which include a group identifier, representative message, representative execution path, count, and aggregated runtime data.
    Type: Application
    Filed: December 1, 2006
    Publication date: June 5, 2008
    Applicant: COMPUTER ASSOCIATES THINK, INC.
    Inventors: Jyoti Kumar Bansal, David Isaiah Seidman, Mark J. Addleman