×

Parallel processing database tree structure

  • US 9,594,803 B2
  • Filed: 09/10/2015
  • Issued: 03/14/2017
  • Est. Priority Date: 02/25/2013
  • Status: Active Grant
First Claim
Patent Images

1. A method for executing queries in a parallel processing database system, comprising:

  • receiving a query at a master node, the master node comprising a database catalog including metadata;

    deriving a plurality of query plans based at least in part on the query;

    transmitting, to a plurality of worker nodes, corresponding ones of the plurality of query plans and associated query metadata, wherein the query metadata includes information used in connection with executing the query plans; and

    in the event that additional metadata is needed in connection with executing one of the plurality of query plans, receiving a request for additional metadata corresponding to the query plan for which additional metadata is needed, wherein a parent node is queried for the additional metadata, the parent node comprising a metadata cache, and in the event that the parent node does not comprise the additional metadata, successive ancestor nodes are queried until the additional metadata is found or until all successive ancestor nodes have been queried.

View all claims
  • 9 Assignments
Timeline View
Assignment View
    ×
    ×