Patents by Inventor Harish Akali

Harish Akali 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: 10891297
    Abstract: Disclosed is a system, method, and computer program product for implementing a log analytics method and system that can configure, collect, and analyze log records in an efficient manner. In addition, a method and system is provided for implementing collection-wise processing within a log analytics system.
    Type: Grant
    Filed: April 1, 2016
    Date of Patent: January 12, 2021
    Assignee: Oracle International Corporation
    Inventors: Shushuai Zhu, Harish Akali, Jerry Russell, Haobo He, Gaylen Royal, Wyn Owen
  • Patent number: 10713271
    Abstract: The present disclosure relates to querying log messages stored at log endpoints (e.g., log cores) using query strings that reference virtual fields, and generating log field views presenting aggregate information for groups of log messages that are grouped based on criteria defined in the query string.
    Type: Grant
    Filed: February 5, 2018
    Date of Patent: July 14, 2020
    Assignee: Oracle International Corporation
    Inventors: Sreeji Das, Jae Young Yoon, Dhileeban Kumaresan, Venktesh Alvenkar, Harish Akali, Adrienne Wong
  • Patent number: 10474513
    Abstract: Some embodiments relate to assigning individual log messages to clusters. An initial cluster assignment may be performed by applying a hash function to one or more non-variable components of the message to generate an initial cluster identifier. Subsequently, clustering may be further refined (e.g., by determining whether to merge clusters based on similarity values). An interface can present a representative message of each cluster and indicate which portions of the message correspond to a variable component. Particular inputs detected at the input corresponding to one of these components can cause other values for the component to be presented. For a given cluster, timestamps of assigned messages can be used to generate a time series, which can facilitate grouping of clusters (with similar or complementary shapes) and/or triggering alerts (with a condition corresponding to a temporal aspect).
    Type: Grant
    Filed: January 26, 2017
    Date of Patent: November 12, 2019
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Jae Young Yoon, Dhileeban Kumaresan, Venktesh Alvenkar, Sreeji Das, Harish Akali
  • Patent number: 10353756
    Abstract: Some embodiments relate to assigning individual log messages to clusters. An initial cluster assignment may be performed by applying a hash function to one or more non-variable components of the message to generate an initial cluster identifier. Subsequently, clustering may be further refined (e.g., by determining whether to merge clusters based on similarity values). An interface can present a representative message of each cluster and indicate which portions of the message correspond to a variable component. Particular inputs detected at the input corresponding to one of these components can cause other values for the component to be presented. For a given cluster, timestamps of assigned messages can be used to generate a time series, which can facilitate grouping of clusters (with similar or complementary shapes) and/or triggering alerts (with a condition corresponding to a temporal aspect).
    Type: Grant
    Filed: January 26, 2017
    Date of Patent: July 16, 2019
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Jae Young Yoon, Dhileeban Kumaresan, Venktesh Alvenkar, Sreeji Das, Harish Akali
  • Patent number: 10338977
    Abstract: Some embodiments relate to assigning individual log messages to clusters. An initial cluster assignment may be performed by applying a hash function to one or more non-variable components of the message to generate an initial cluster identifier. Subsequently, clustering may be further refined (e.g., by determining whether to merge clusters based on similarity values). An interface can present a representative message of each cluster and indicate which portions of the message correspond to a variable component. Particular inputs detected at the input corresponding to one of these components can cause other values for the component to be presented. For a given cluster, timestamps of assigned messages can be used to generate a time series, which can facilitate grouping of clusters (with similar or complementary shapes) and/or triggering alerts (with a condition corresponding to a temporal aspect).
    Type: Grant
    Filed: January 26, 2017
    Date of Patent: July 2, 2019
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Jae Young Yoon, Dhileeban Kumaresan, Venktesh Alvenkar, Sreeji Das, Harish Akali
  • Publication number: 20180232425
    Abstract: The present disclosure relates to querying log messages stored at log endpoints (e.g., log cores) using query strings that reference virtual fields, and generating log field views presenting aggregate information for groups of log messages that are grouped based on criteria defined in the query string.
    Type: Application
    Filed: February 5, 2018
    Publication date: August 16, 2018
    Applicant: Oracle International Corporation
    Inventors: Sreeji Das, Jae Young Yoon, Dhileeban Kumaresan, Venktesh Alvenkar, Harish Akali, Adrienne Wong
  • Publication number: 20180114126
    Abstract: The present disclosure relates to identifying process flows from log sources (e.g., log files), and generating visual representations (e.g., flow diagrams, Sankey diagrams, etc.) of the identified process flows. In addition, the present disclosure relates to clustering of tree structures based on the shape of the tree structure using one or more hashing algorithms. The present disclosure also relates to a user interface that presents a query builder for efficiently querying a log analytics system for tree structures that satisfy a user-defined range.
    Type: Application
    Filed: May 31, 2017
    Publication date: April 26, 2018
    Applicant: Oracle International Corporation
    Inventors: Sreeji Das, Jae Young Yoon, Dhileeban Kumaresan, Venktesh Alvenkar, Harish Akali, Hari Krishna Galla
  • Publication number: 20180113578
    Abstract: The present disclosure relates to identifying process flows from log sources (e.g., log files), and generating visual representations (e.g., flow diagrams, Sankey diagrams, etc.) of the identified process flows. In addition, the present disclosure relates to clustering of tree structures based on the shape of the tree structure using one or more hashing algorithms. The present disclosure also relates to a user interface that presents a query builder for efficiently querying a log analytics system for tree structures that satisfy a user-defined range.
    Type: Application
    Filed: May 31, 2017
    Publication date: April 26, 2018
    Applicant: Oracle International Corporation
    Inventors: Jae Young Yoon, Dhileeban Kumaresan, Venktesh Alvenkar, Sreeji Das, Harish Akali, Hari Krishna Galla
  • Publication number: 20180102938
    Abstract: Some embodiments relate to assigning individual log messages to clusters. An initial cluster assignment may be performed by applying a hash function to one or more non-variable components of the message to generate an initial cluster identifier. Subsequently, clustering may be further refined (e.g., by determining whether to merge clusters based on similarity values). An interface can present a representative message of each cluster and indicate which portions of the message correspond to a variable component. Particular inputs detected at the input corresponding to one of these components can cause other values for the component to be presented. For a given cluster, timestamps of assigned messages can be used to generate a time series, which can facilitate grouping of clusters (with similar or complementary shapes) and/or triggering alerts (with a condition corresponding to a temporal aspect).
    Type: Application
    Filed: January 26, 2017
    Publication date: April 12, 2018
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Jae Young Yoon, Dhileeban Kumaresan, Venktesh Alvenkar, Sreeji Das, Harish Akali
  • Publication number: 20180101607
    Abstract: Some embodiments relate to assigning individual log messages to clusters. An initial cluster assignment may be performed by applying a hash function to one or more non-variable components of the message to generate an initial cluster identifier. Subsequently, clustering may be further refined (e.g., by determining whether to merge clusters based on similarity values). An interface can present a representative message of each cluster and indicate which portions of the message correspond to a variable component. Particular inputs detected at the input corresponding to one of these components can cause other values for the component to be presented. For a given cluster, timestamps of assigned messages can be used to generate a time series, which can facilitate grouping of clusters (with similar or complementary shapes) and/or triggering alerts (with a condition corresponding to a temporal aspect).
    Type: Application
    Filed: January 26, 2017
    Publication date: April 12, 2018
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Jae Young Yoon, Dhileeban Kumaresan, Venktesh Alvenkar, Sreeji Das, Harish Akali
  • Publication number: 20180101423
    Abstract: Some embodiments relate to assigning individual log messages to clusters. An initial cluster assignment may be performed by applying a hash function to one or more non-variable components of the message to generate an initial cluster identifier. Subsequently, clustering may be further refined (e.g., by determining whether to merge clusters based on similarity values). An interface can present a representative message of each cluster and indicate which portions of the message correspond to a variable component. Particular inputs detected at the input corresponding to one of these components can cause other values for the component to be presented. For a given cluster, timestamps of assigned messages can be used to generate a time series, which can facilitate grouping of clusters (with similar or complementary shapes) and/or triggering alerts (with a condition corresponding to a temporal aspect).
    Type: Application
    Filed: January 26, 2017
    Publication date: April 12, 2018
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Jae Young Yoon, Dhileeban Kumaresan, Venktesh Alvenkar, Sreeji Das, Harish Akali
  • Publication number: 20170004185
    Abstract: Disclosed is a system, method, and computer program product for implementing a log analytics method and system that can configure, collect, and analyze log records in an efficient manner. In addition, a method and system is provided for implementing collection-wise processing within a log analytics system.
    Type: Application
    Filed: April 1, 2016
    Publication date: January 5, 2017
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Shushuai ZHU, Harish AKALI, Jerry RUSSELL, Haobo HE, Gaylen ROYAL, Wyn OWEN
  • Patent number: 9311369
    Abstract: Systems, methods, and other embodiments associated with virtual masked databases are described. One example system includes a masking logic to mask an unmasked column of a database table to produce a masked column. The masked column is then added to the database creating a bi-masked database. A portion of the bi-masked database is then selected by a view logic and provided to a user. The view provided to the user may allow fast, conflict free queries and updates to the database. By providing the user either masked or unmasked data based on information associated with the user, an added layer of data security may be achieved.
    Type: Grant
    Filed: August 15, 2008
    Date of Patent: April 12, 2016
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Ravi Pattabhi, Harish Akali
  • Patent number: 7996442
    Abstract: A method, system, and computer program product provides the capability to compare data object definitions in a database in a less costly and less time-consuming manner than previous techniques. A method of comparing multiple versions of data item definitions in a database comprises generating a first version of comparison information relating to a plurality of data item definitions in the database by comparing information relating to data item definitions obtained from a first source and information relating to data item definitions obtained from a second source and generating a second version of comparison information relating to a plurality of data item definitions in the database by comparing information relating to data item definitions obtained from a first source and information relating to data item definitions obtained from a second source to the first version of comparison information.
    Type: Grant
    Filed: October 17, 2005
    Date of Patent: August 9, 2011
    Assignee: Oracle International Corporation
    Inventors: Andrew Heath Bodge, Harish Akali, Luming Han, Xiaolan Shen
  • Patent number: 7979410
    Abstract: Systems, methods, and other embodiments associated with maintaining referential integrity while masking database columns are described. One example method includes determining a transitive closure for dependency relationships involving a column to be masked and other columns related to the column to be masked through a dependency relationship. The example method may also include identifying a root column for a column in the transitive closure and creating a mapping table that stores original values and masking values for the root column. The method includes masking the root column and related child columns based on the mapping table in a manner that maintains referential integrity between the root column and the child column. Integrity may be maintained by masking corresponding values in the root column and a child column(s) with identical mask values from the mapping table.
    Type: Grant
    Filed: July 30, 2008
    Date of Patent: July 12, 2011
    Assignee: Oracle International Corp.
    Inventors: Ravi Pattabhi, Harish Akali, Luming Han, Xiaolan Shen, Andrew Bodge
  • Patent number: 7882134
    Abstract: Systems, methodologies, media, and other embodiments associated with producing non-repeating random values for use in data masking are described. One example method includes accessing data describing a mask for a value in a database table column to be masked. The example method may also include identifying a number of distinct values in the database table column to be masked and determining a field width for a mask to provide unique random numbers to mask the distinct values. The method may include identifying locations in a mask value to store the unique random value and locations in a mask value to store filler values. The mask value may include different character sets and may comply with user specified formats. The method may include generating a set of statements that when executed produce a mapping table that includes masks for distinct values in the database table column to be masked.
    Type: Grant
    Filed: April 28, 2008
    Date of Patent: February 1, 2011
    Assignee: Oracle International Corporation
    Inventors: Ravi Pattabhi, Harish Akali, Luming Han, Xiaolan Shen, Andrew Bodge
  • Publication number: 20100042643
    Abstract: Systems, methods, and other embodiments associated with virtual masked databases are described. One example system includes a masking logic to mask an unmasked column of a database table to produce a masked column. The masked column is then added to the database creating a bi-masked database. A portion of the bi-masked database is then selected by a view logic and provided to a user. The view provided to the user may allow fast, conflict free queries and updates to the database. By providing the user either masked or unmasked data based on information associated with the user, an added layer of data security may be achieved.
    Type: Application
    Filed: August 15, 2008
    Publication date: February 18, 2010
    Applicant: Oracle International Corp
    Inventors: Ravi Pattabhi, Harish Akali
  • Publication number: 20100030795
    Abstract: Systems, methods, and other embodiments associated with maintaining referential integrity while masking database columns are described. One example method includes determining a transitive closure for dependency relationships involving a column to be masked and other columns related to the column to be masked through a dependency relationship. The example method may also include identifying a root column for a column in the transitive closure and creating a mapping table that stores original values and masking values for the root column. The method includes masking the root column and related child columns based on the mapping table in a manner that maintains referential integrity between the root column and the child column. Integrity may be maintained by masking corresponding values in the root column and a child column(s) with identical mask values from the mapping table.
    Type: Application
    Filed: July 30, 2008
    Publication date: February 4, 2010
    Applicant: Oracle International Corp.
    Inventors: Ravi Pattabhi, Harish Akali, Luming Han, Xiaolan Shen, Andrew Bodge
  • Publication number: 20090271361
    Abstract: Systems, methodologies, media, and other embodiments associated with producing non-repeating random values for use in data masking are described. One example method includes accessing data describing a mask for a value in a database table column to be masked. The example method may also include identifying a number of distinct values in the database table column to be masked and determining a field width for a mask to provide unique random numbers to mask the distinct values. The method may include identifying locations in a mask value to store the unique random value and locations in a mask value to store filler values. The mask value may include different character sets and may comply with user specified formats. The method may include generating a set of statements that when executed produce a mapping table that includes masks for distinct values in the database table column to be masked.
    Type: Application
    Filed: April 28, 2008
    Publication date: October 29, 2009
    Applicant: Oracle International Corp.
    Inventors: Ravi Pattabhi, Harish Akali, Luming Han, Xiaolan Shen, Andrew Bodge
  • Publication number: 20070088733
    Abstract: A method, system, and computer program product provides the capability to compare data object definitions in a database in a less costly and less time-consuming manner than previous techniques. A method of comparing multiple versions of data item definitions in a database comprises generating a first version of comparison information relating to a plurality of data item definitions in the database by comparing information relating to data item definitions obtained from a first source and information relating to data item definitions obtained from a second source and generating a second version of comparison information relating to a plurality of data item definitions in the database by comparing information relating to data item definitions obtained from a first source and information relating to data item definitions obtained from a second source to the first version of comparison information.
    Type: Application
    Filed: October 17, 2005
    Publication date: April 19, 2007
    Inventors: Andrew Bodge, Harish Akali, Luming Han, Xiaolan Shen