Method and mechanism for efficient re-distribution of in-memory columnar units in a clustered RDBMS on topology change

• US 10,528,580 B2
• Filed: 01/27/2016
• Issued: 01/07/2020
• Est. Priority Date: 01/27/2016
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Mukherjee, Niloy, Kulkarni, Kartik, Lahiri, Tirthankar, Marwah, Vineet, Loaiza, Juan
• Primary Examiner(s): Saeed, Usmaan
• Assistant Examiner(s): Bartlett, William P
• Application Number:
  US15/008,297
• Publication Number:
  US 20170212939A1
• Time in Patent Office: 1,441 Days
• CPC Class Codes: G06F 16/2477 Temporal data queries
• CPC Class Codes: H04L 41/0668 by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 43/0817 by checking functioning

Abstract

Techniques are described herein for executing queries on distinct portions of a database object that has been separate into chunks and distributed across the volatile memories of a plurality of nodes in a clustered database system. The techniques involve redistributing the in-memory database object portions on changes to the clustered database system. Each node may maintain a mapping indicating which nodes in the clustered database system store which chunks, and timestamps indicating when each mapping entry was created or updated. A query coordinator may use the timestamps to select a database server instance with local in memory access to data required by a portion of a query to process that portion of the query.

Claims

1. A method comprising:

maintaining at a particular node, in a system that includes a plurality of nodes, a mapping that indicates;

a plurality of host nodes for a particular chunk of data, wherein each host node of the plurality of host nodes is a node that has been assigned to load a copy of the particular chunk of data into its volatile memory; and

for each host node, of the plurality of host nodes, a registration timestamp corresponding to a most recent time at which the particular node registered the host node as a host for the particular chunk of data;

maintaining, at the particular node, a global completion timestamp that indicates a particular time;

wherein, at the particular time, all host nodes that had been assigned to the particular chunk had completed loading the particular chunk into their respective volatile memories;

receiving, at the particular node, a query requiring access to the particular chunk;

in response to the query, performing the steps of;

selecting a particular host node, of the plurality of host nodes, based at least in part on comparisons between the global completion timestamp and the registration timestamps of the plurality of host nodes;

wherein the particular host node is selected to be a target candidate to perform work for the query based, at least in part, on the registration timestamp of the particular host node being less than the global completion timestamp;

causing the particular host node to perform work, for the query, that involves accessing data items in the particular chunk;

wherein the method is performed by one or more computing devices.

2. The method of claim 1 further comprising:

wherein each node of the plurality of nodes maintains a respective mapping;

detecting when a node, that hosts one or more chunks, has been removed;

determining, for each chunk of the one or more chunks, a respective additional host node; and

updating, for each node in the plurality of nodes, the respective mapping to indicate;

the respective additional host node for each chunk of the one or more chunks; and

an updated registration timestamp corresponding to the respective additional host node for each chunk of the one or more chunks.

3. The method of claim 1:

wherein the plurality of host nodes includes a first host where a startup time of the first host is greater than the global completion time;

wherein the plurality of host nodes includes a second host wherein the startup time of the second host is less than the global completion time; and

wherein the step of selecting a particular node involves selecting the second host over the first host.

4. The method of claim 1:

wherein the plurality of host nodes includes a first host where the registration time corresponding to the first host is greater than the global completion time;

wherein the plurality of host nodes includes a second host wherein the registration time corresponding to the second host is less than the global completion time; and

wherein the step of selecting a particular node involves selecting the second host over the first host.

5. The method of claim 1:

wherein the plurality of host nodes includes a first host where a startup time of the first host is greater than the registration time corresponding to the first host;

wherein the plurality of host nodes includes a second host wherein the startup time of the second host is less than the registration time corresponding to the second host; and

wherein the step of selecting a particular node involves selecting the second host over the first host.

6. The method of claim 1:

wherein the plurality of host nodes includes a first host where the registration time corresponding to the first host is less than the global completion time;

wherein the plurality of host nodes includes a second host wherein the registration time corresponding the second node is less than the global completion time; and

wherein first host is the particular node and the step of selecting a particular node involves selecting the first host over the second host.

7. The method of claim 1:

wherein the plurality of host nodes includes a first host where the registration time corresponding to the first host is greater than the global completion time;

wherein the plurality of host nodes includes a second host wherein the registration time corresponding to the second host is less than the global completion time; and

wherein first host is the particular node and the step of selecting a particular node involves selecting the second host over the first host.

8. One or more non-transitory computer-readable media storing instructions, wherein the instructions include:

instructions which, when executed by one or more hardware processors, cause maintaining at a particular node, in a system that includes a plurality of nodes, a mapping that indicates;

a particular chunk of data;

a plurality of host nodes for the particular chunk of data, wherein each host node of the plurality of host nodes is a node that has been assigned to load a copy of the particular chunk of data into its volatile memory; and

for each host node, of the plurality of host nodes, a registration timestamp corresponding to a most recent time at which the particular node the host node as a host node for the particular chunk of data;

instructions which, when executed by one or more hardware processors, cause maintaining, at the particular node, a global completion timestamp that indicates a particular time;

wherein, at the particular time, all host nodes that had been assigned to the particular chunk had completed loading the particular chunk into their respective volatile memories;

instructions which, when executed by one or more hardware processors, cause receiving, at the particular node, a query requiring access to the particular chunk;

instructions which, when executed by one or more hardware processors, cause in response to the query, performing the steps of;

selecting a particular host node, of the plurality of host nodes, based at least in part on comparisons between the global completion timestamp and the registration timestamps of the plurality of host nodes;

wherein the particular host node is selected to be a target candidate to perform work for the query based, at least in part, on the registration timestamp of the particular host node being less than the global completion timestamp;

causing the particular host node to perform work, for the query, that involves accessing data items in the particular chunk.

9. The one or more non-transitory computer-readable media of claim 8, wherein each node of the plurality of nodes maintains a respective mapping, the instructions further including:

instructions which, when executed by one or more hardware processors, cause detecting when a node has been removed;

instructions which, when executed by one or more hardware processors, cause determining, for each chunk for which the removed node was a host node, a respective additional host node; and

instructions which, when executed by one or more hardware processors, cause updating, for each node in the plurality of nodes, the respective mapping to indicate;

the respective additional host node for each chunk for which the removed node was a host node; and

an updated registration timestamp corresponding to the respective additional host node for each chunk for which the removed node was a host node.

10. The one or more non-transitory computer-readable media of claim 8:

wherein the plurality of host nodes includes a first host where a startup time of the first host is greater than the global completion time;

wherein the plurality of host nodes includes a second host wherein the startup time of the second host is less than the global completion time; and

wherein the step of selecting a particular node involves selecting the second host over the first host.

11. The one or more non-transitory computer-readable media of claim 8:

wherein the plurality of host nodes includes a first host where the registration time corresponding to the first host is greater than the global completion time;

wherein the plurality of host nodes includes a second host wherein the registration time corresponding to the second host is less than the global completion time; and

wherein the step of selecting a particular node involves selecting the second host over the first host.

12. The one or more non-transitory computer-readable media of claim 8:

wherein the plurality of host nodes includes a first host where a startup time of the first host is greater than the registration time corresponding to the first host;

wherein the plurality of host nodes includes a second host wherein the startup time of the second host is less than the registration time corresponding to the second host; and

wherein the step of selecting a particular node involves selecting the second host over the first host.

13. The one or more non-transitory computer-readable media of claim 8:

wherein the plurality of host nodes includes a first host where the registration time corresponding to the first host is less than the global completion time;

wherein the plurality of host nodes includes a second host wherein the registration time corresponding the second node is less than the global completion time; and

wherein first host is the particular node and the step of selecting a particular node involves selecting the first host over the second host.

14. The one or more non-transitory computer-readable media of claim 8:

wherein the plurality of host nodes includes a first host where the registration time corresponding to the first host is greater than the global completion time;

wherein the plurality of host nodes includes a second host wherein the registration time corresponding the second node is less than the global completion time; and

wherein first host is the particular node and the step of selecting a particular node involves selecting the second host over the first host.