Patents by Inventor Daniel Georg Schall

Daniel Georg Schall 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: 20240045865
    Abstract: Methods, systems, and computer program products are provided that construct and execute multi-step query plans in a database application. A database application accepts a query such as, for example, a graph query. The database application generates a physical query plan comprising a set of execution steps that perform the query. The set of execution steps comprises at least an initial step, an intermediate step and a final step. The database executes the query by passing control to the initial step that, when complete, passes execution control to some other step. The intermediate step executes and when complete, may pass execution control to any other step including itself. Steps may be configured to communicate arbitrary data between steps. The generated query plan may also comprise multiple multi-step sequences, and such sequences may be configured to execute in the alternative based on intermediate query results, or a parameter included in the query.
    Type: Application
    Filed: October 16, 2023
    Publication date: February 8, 2024
    Inventors: Craig Steven FREEDMAN, Chandrashekhar KADIAM, Devin L. RIDER, Daniel Georg SCHALL
  • Patent number: 11829363
    Abstract: Methods, systems, and computer program products are provided that construct and execute multi-step query plans in a database application. A database application accepts a query such as, for example, a graph query. The database application generates a physical query plan comprising a set of execution steps that perform the query. The set of execution steps comprises at least an initial step, an intermediate step and a final step. The database executes the query by passing control to the initial step that, when complete, passes execution control to some other step. The intermediate step executes and when complete, may pass execution control to any other step including itself. Steps may be configured to communicate arbitrary data between steps. The generated query plan may also comprise multiple multi-step sequences, and such sequences may be configured to execute in the alternative based on intermediate query results, or a parameter included in the query.
    Type: Grant
    Filed: October 6, 2018
    Date of Patent: November 28, 2023
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Craig Steven Freedman, Chandrashekhar Kadiam, Devin L Rider, Daniel Georg Schall
  • Patent number: 11093499
    Abstract: Examples described herein generally relate to executing a received graph database query. The received graph database query can be converted into a recursive common table expression (CTE). Multiple alternative processes for executing the recursive CTE can be generated based on the recursive CTE. A cost associated with each of the multiple alternative processes can be determined. One of the multiple alternative processes can be converted into a multi-step sequence based on the associated cost. The multi-step sequence can be executed on a database to retrieve a set of results in response to the received graph database query.
    Type: Grant
    Filed: March 8, 2019
    Date of Patent: August 17, 2021
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Chandrashekhar Kadiam, Craig Steven Freedman, Daniel Georg Schall, Devin Leo Rider, Nitish Jindal
  • Publication number: 20200285643
    Abstract: Examples described herein generally relate to executing a received graph database query. The received graph database query can be converted into a recursive common table expression (CTE). Multiple alternative processes for executing the recursive CTE can be generated based on the recursive CTE. A cost associated with each of the multiple alternative processes can be determined. One of the multiple alternative processes can be converted into a multi-step sequence based on the associated cost. The multi-step sequence can be executed on a database to retrieve a set of results in response to the received graph database query.
    Type: Application
    Filed: March 8, 2019
    Publication date: September 10, 2020
    Inventors: Chandrashekhar KADIAM, Craig Steven FREEDMAN, Daniel Georg SCHALL, Devin Leo RIDER, Nitish JINDAL
  • Publication number: 20200110827
    Abstract: Methods, systems, and computer program products are provided that construct and execute multi-step query plans in a database application. A database application accepts a query such as, for example, a graph query. The database application generates a physical query plan comprising a set of execution steps that perform the query. The set of execution steps comprises at least an initial step, an intermediate step and a final step. The database executes the query by passing control to the initial step that, when complete, passes execution control to some other step. The intermediate step executes and when complete, may pass execution control to any other step including itself. Steps may be configured to communicate arbitrary data between steps. The generated query plan may also comprise multiple multi-step sequences, and such sequences may be configured to execute in the alternative based on intermediate query results, or a parameter included in the query.
    Type: Application
    Filed: October 6, 2018
    Publication date: April 9, 2020
    Inventors: Craig Steven Freedman, Chandrashekhar Kadiam, Devin L. Rider, Daniel Georg Schall