PARALLEL PROCESSING DATABASE TREE STRUCTURE

• US 20150379078A1
• Filed: 09/10/2015
• Published: 12/31/2015
• Est. Priority Date: 02/25/2013
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: EMC Corporation (Dell Technologies Inc.)
• Inventors: Welton, Caleb E., Harada, Hitoshi, Cohen, Jeffrey Ira, Chang, Lei, Reddy, Radhika, Ma, Tao, Wang, Zhanwei
• Granted Patent: US 9,594,803 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/10 File systems; File servers
• CPC Class Codes: G06F 16/11 File system administration, e.g. details of archiving or snapshots file system backup G06F11/14
• CPC Class Codes: G06F 16/113 Details of archiving lifecycle management in storage systems G06F3/0649; backup systems G06F11/1446
• CPC Class Codes: G06F 16/148 File search processing
• CPC Class Codes: G06F 16/182 Distributed file systems
• CPC Class Codes: G06F 16/1858 Parallel file systems, i.e. file systems supporting multiple processors
• CPC Class Codes: G06F 16/217 Database tuning G06F16/2282 takes precedence; database performance monitoring G06F11/3409
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/24524 Access plan code generation and invalidation; Reuse of access plans
• CPC Class Codes: G06F 16/2453 Query optimisation
• CPC Class Codes: G06F 16/24532 of parallel queries
• CPC Class Codes: G06F 16/24542 Plan optimisation
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/2471 Distributed queries
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: G06F 16/43 Querying
• CPC Class Codes: G06F 16/907 Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
• CPC Class Codes: H04L 65/60 Network streaming of media packets
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

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.

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;

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.

2. The method of claim 1, wherein the metadata included in the database catalog defines database objects.

3. The method of claim 1, wherein the request for the additional metadata is sent to the master node by an ancestor node of the worker node to which the corresponding query plan was transmitted.

4. The method of claim 3, wherein the request for the additional metadata is iteratively communicated to successive ancestor nodes of the worker node to which the corresponding query plan was transmitted.

5. The method of claim 3, wherein the request for the additional metadata is iteratively communicated to successive ancestor nodes of the worker node to which the corresponding query plan was transmitted until the master node is reached.

6. The method of claim 1, further comprising querying successive ancestor nodes until the additional metadata is found.

7. The method of claim 1, wherein the master node is a root node in tree structure.

8. The method of claim 1, further comprising:

querying a parent node for the additional metadata, wherein the parent node comprises a metadata cache.

9. The method of claim 8, further comprising checking the metadata cache for the additional metadata.

10. The method of claim 1, wherein the query plans include a set of instructions.

11. 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.

12. The method of claim 1, wherein the request for additional metadata is sent in connection with a query for the additional metadata, and in the event that the query is received at the master node, establishing a catalog server session corresponding to the query, and retrieving additional query metadata from a metadata catalog stored on a database catalog server.

13. The method of claim 1, wherein the plurality of worker nodes are connected to the master node, and wherein the plurality of worker nodes respectively comprise a database configured to execute a database query corresponding to the respective query plan and associated query metadata that is received from the master node.

14. 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;

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.

15. The computer program product of claim 14, wherein the metadata included in the database catalog defines database objects.

16. The computer program product of claim 14, wherein the request for the additional metadata is sent to the master node by an ancestor node of the worker node to which the corresponding query plan was transmitted.

17. The computer program product of claim 16, wherein the request for the additional metadata is iteratively communicated to successive ancestor nodes of the worker node to which the corresponding query plan was transmitted.

18. The computer program product of claim 16, wherein the request for the additional metadata is iteratively communicated to successive ancestor nodes of the worker node to which the corresponding query plan was transmitted until the master node is reached.

19. The computer program product of claim 14, the non-transitory computer readable medium having program instructions embodied therein for querying successive ancestor nodes until the additional metadata is found.

20. The computer program product of claim 14, wherein the master node is a root node in tree structure.

21. The computer program product of claim 14, wherein a parent node is queried, by the worker node, for the additional metadata, wherein the parent node comprises a metadata cache.

22. The computer program product of claim 21, the non-transitory computer readable medium having program instructions embodied therein for checking the metadata cache for the additional metadata.

23. 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;

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

transmit, 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, receive a request for additional metadata corresponding to the query plan for which additional metadata is needed.

24. The system of claim 23, wherein the metadata included in the database catalog defines database objects.

25. The system of claim 23, wherein the request for the additional metadata is sent to the master node by an ancestor node of the worker node to which the corresponding query plan was transmitted.

26. The system of claim 25, wherein the request for the additional metadata is iteratively communicated to successive ancestor nodes of the worker node to which the corresponding query plan was transmitted.

27. The system of claim 25, wherein the request for the additional metadata is iteratively communicated to successive ancestor nodes of the worker node to which the corresponding query plan was transmitted until the master node is reached.

28. The system of claim 23, wherein successive ancestor nodes are queried until the additional metadata is found.

29. The system of claim 23, wherein the master node is a root node in tree structure.

30. The system of claim 23, wherein a parent node is queried for the additional information, wherein the parent node comprises a metadata cache.

31. The system of claim 30, wherein the parent node checks the metadata cache for the additional metadata.