Patents by Inventor Anna PAVLENKO

Anna PAVLENKO 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).

  • Publication number: 20260154263
    Abstract: Embodiments described herein are directed to generating and returning materialized views for queries (or subexpressions thereof) having a particular relationship with each other. For instance, machine learning-based techniques may be utilized to identify query subexpressions that have at least one of a semantically equivalent relationship or a containment relationship with each other. Responsive to identifying such relationship(s), a materialized view may be generated for the identified subexpressions. When a query is subsequently received, machine learning-based techniques may be utilized to determine whether a subexpression of the query possesses at least one of a semantically equivalent relationship or a containment relationship with another subexpression for which a materialized view has been generated. Responsive to determining that such a subexpression of the query possesses one or more of such relationships, the materialized view generated for the other subexpression is returned.
    Type: Application
    Filed: January 21, 2026
    Publication date: June 4, 2026
    Inventors: Brandon Barry HAYNES, Jyoti LEEKA, Anna PAVLENKO, Rana ALOTAIBI, Alekh JINDAL
  • Publication number: 20260072913
    Abstract: Examples detect equivalent subexpressions within a computational workload. Examples include converting a query plan tree associated with a first subexpression into a matrix. The first subexpression is a portion of a database query from the computational workload. Each node in the query plan tree is represented as a row of the matrix. The matrix is converted into a first vector. The first subexpression is determined to be equivalent to a second subexpression by comparing the first vector to a second vector associated with the second subexpression. The comparison includes computing a distance between the first and second vectors that is lower than a distance threshold. The computational workload is modified, based on the determining, to perform the first subexpression and exclude performance of the second subexpression as duplicative.
    Type: Application
    Filed: September 10, 2025
    Publication date: March 12, 2026
    Inventors: Brandon Barry HAYNES, Rana Bijad M ALOTAIBI, Anna PAVLENKO, Yuanyuan TIAN, Jyoti LEEKA, Alekh JINDAL
  • Patent number: 12561321
    Abstract: Embodiments described herein are directed to generating and returning materialized views for queries (or subexpressions thereof) having a particular relationship with each other. For instance, machine learning-based techniques may be utilized to identify query subexpressions that have at least one of a semantically equivalent relationship or a containment relationship with each other. Responsive to identifying such relationship(s), a materialized view may be generated for the identified subexpressions. When a query is subsequently received, machine learning-based techniques may be utilized to determine whether a subexpression of the query possesses at least one of a semantically equivalent relationship or a containment relationship with another subexpression for which a materialized view has been generated. Responsive to determining that such a subexpression of the query possesses one or more of such relationships, the materialized view generated for the other subexpression is returned.
    Type: Grant
    Filed: April 30, 2022
    Date of Patent: February 24, 2026
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Brandon Barry Haynes, Jyoti Leeka, Anna Pavlenko, Rana Alotaibi, Alekh Jindal
  • Patent number: 12436950
    Abstract: Examples detect equivalent subexpressions within a computational workload. Examples include converting a query plan tree associated with a first subexpression into a matrix. The first subexpression is a portion of a database query from the computational workload. Each node in the query plan tree is represented as a row of the matrix. The matrix is converted into a first vector. The first subexpression is determined to be equivalent to a second subexpression by comparing the first vector to a second vector associated with the second subexpression. The comparison includes computing a distance between the first and second vectors that is lower than a distance threshold. The computational workload is modified, based on the determining, to perform the first subexpression and exclude performance of the second subexpression as duplicative.
    Type: Grant
    Filed: March 29, 2024
    Date of Patent: October 7, 2025
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Brandon Barry Haynes, Rana Bijad M Alotaibi, Anna Pavlenko, Yuanyuan Tian, Jyoti Leeka, Alekh Jindal
  • Publication number: 20250307245
    Abstract: Examples detect equivalent subexpressions within a computational workload. Examples include converting a query plan tree associated with a first subexpression into a matrix. The first subexpression is a portion of a database query from the computational workload. Each node in the query plan tree is represented as a row of the matrix. The matrix is converted into a first vector. The first subexpression is determined to be equivalent to a second subexpression by comparing the first vector to a second vector associated with the second subexpression. The comparison includes computing a distance between the first and second vectors that is lower than a distance threshold. The computational workload is modified, based on the determining, to perform the first subexpression and exclude performance of the second subexpression as duplicative.
    Type: Application
    Filed: March 29, 2024
    Publication date: October 2, 2025
    Inventors: Brandon Barry HAYNES, Rana Bijad M. ALOTAIBI, Anna PAVLENKO, Yuanyuan TIAN, Jyoti LEEKA, Alekh JINDAL
  • Publication number: 20240411609
    Abstract: System, methods, apparatuses, and computer program products are disclosed for auto-scaling of a deployment based on resource utilization data for a workload executing on the deployment. A resource availability is determined based on the resource utilization data and a current resource allocation of the deployment. A severity of resource throttling of the workload may be determined based on the resource utilization data, and a scaling factor is determined based at least on the severity of resource throttling. In response to at least the resource availability satisfying a predetermined condition with a predetermined threshold, the deployment is scaled based on the scaling factor.
    Type: Application
    Filed: September 22, 2023
    Publication date: December 12, 2024
    Inventors: Karla Jean SAUR, Joyce Yu CAHOON, Yiwen ZHU, Anna PAVLENKO, Jesus CAMACHO RODRIGUEZ, Brian Paul KROTH, Travis Austin WRIGHT, Michael Edward NELSON, David LIAO, Andrew Sherman CARTER
  • Publication number: 20230350892
    Abstract: Embodiments described herein are directed to generating and returning materialized views for queries (or subexpressions thereof) having a particular relationship with each other. For instance, machine learning-based techniques may be utilized to identify query subexpressions that have at least one of a semantically equivalent relationship or a containment relationship with each other. Responsive to identifying such relationship(s), a materialized view may be generated for the identified subexpressions. When a query is subsequently received, machine learning-based techniques may be utilized to determine whether a subexpression of the query possesses at least one of a semantically equivalent relationship or a containment relationship with another subexpression for which a materialized view has been generated. Responsive to determining that such a subexpression of the query possesses one or more of such relationships, the materialized view generated for the other subexpression is returned.
    Type: Application
    Filed: April 30, 2022
    Publication date: November 2, 2023
    Inventors: Brandon Barry HAYNES, Jyoti LEEKA, Anna PAVLENKO, Rana ALOTAIBI, Alekh JINDAL