Parallel processing database tree structure
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.
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.
2. The method of claim 1 , further comprising querying successive ancestor nodes until the additional metadata is found.
3. The method of claim 1 , wherein the master node is a root node in tree structure.
4. The method of claim 1 , wherein the parent node comprises a metadata cache.
5. The method of claim 4 , further comprising checking the cache for the additional metadata.
6. The method of claim 1 , wherein the query plans include a set of instructions.
7. The method of claim 1 , wherein the query metadata includes one or more of a database table definition, a database function, a database view, and a database index.
8. The method of claim 1 , further comprising:
in the event that the query is received at the master node, establishing a catalog server session corresponding to the query, and retrieving the query metadata from a metadata catalog stored on a database catalog server.
9. The method of claim 1 , wherein each of the plurality of worker nodes is operatively connected to the master node and comprises a database configured to execute a database query corresponding to the respective query plan and query metadata that is received from the master node.
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.
11. The computer program product of claim 10 , the non-transitory computer readable medium having program instructions embodied therein for querying successive ancestor nodes until the additional metadata is found.
12. The computer program product of claim 10 , wherein the master node is a root node in tree structure.
13. The computer program product of claim 10 , wherein the parent node comprises a metadata cache.
14. The computer program product of claim 13 , the non-transitory computer readable medium having program instructions embodied therein for checking the cache for the additional metadata.
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.
16. The system of claim 15 , wherein the processor is further configured to query successive ancestor nodes until the additional metadata is found.
17. The system of claim 15 , wherein the master node is a root node in tree structure.
18. The system of claim 15 , wherein the parent node comprises a metadata cache.
19. The system of claim 18 , wherein the processor is further configured to check the cache for the additional metadata.