Parallel processing database tree structure
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 defining database objects;
deriving a plurality of query plans from the query;
transmitting the query plans and query metadata to a plurality of worker nodes, wherein the query metadata includes metadata for executing the query plans;
determining additional metadata is needed for executing one of the plurality of query plans; and
querying a parent node for the additional metadata; and
querying successive ancestor nodes until the master node is reached.
10 Assignments
0 Petitions
Accused Products
Abstract
Database system comprising nodes configured in a tree structure is disclosed. The system includes a shared metadata store on the root node. Child nodes may request metadata from their ancestors. Parents will forward the request upward until the metadata is found or the root node is reached.
-
Citations
19 Claims
-
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 defining database objects; deriving a plurality of query plans from the query; transmitting the query plans and query metadata to a plurality of worker nodes, wherein the query metadata includes metadata for executing the query plans; determining additional metadata is needed for executing one of the plurality of query plans; and
querying a parent node for the additional metadata; andquerying successive ancestor nodes until the master node is reached. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A computer program product for executing queries in a parallel processing database system, comprising a non-transitory computer readable medium having program instructions embodied therein for:
-
receiving a query at a master node, the master node comprising a database catalog including metadata defining database objects; deriving a plurality of query plans from the query; transmitting the query plans and query metadata to a plurality of worker nodes, wherein the query metadata includes metadata for executing the query plans; determining additional metadata is needed for executing one of the plurality of query plans; querying a parent node for the additional metadata; and querying successive ancestor nodes until the master node is reached. - View Dependent Claims (11, 12, 13, 14)
-
-
15. A system for executing queries in a parallel processing database, comprising a non-transitory computer readable medium and a processor configured to:
-
receive a query at a master node, the master node comprising a database catalog including metadata defining database objects; derive a plurality of query plans from the query; transmit the query plans and query metadata to a plurality of worker nodes, wherein the query metadata includes metadata for executing the query plans; determine additional metadata is needed for executing one of the plurality of query plans; and query a parent node for the additional metadata; and query successive ancestor nodes until the master node is reached. - View Dependent Claims (16, 17, 18, 19)
-
Specification