Embodiments relate to growing a plurality of trees in parallel. An aspect includes creating, for each of a plurality of trees, a data bag based on a training data set comprising a plurality of data records. Another aspect includes splitting the training data set into disjoint data sub-sets; and storing each of the sub-sets in a respective data slice. Another aspect includes performing a single pass through the data records stored in a data slice, thereby identifying one or more of the current nodes that are assigned data records; calculating an intermediate result for each identified current node based on all data records of said data slice; and merging intermediate results into a combined intermediate result. Another aspect includes, for each of the current nodes: calculating a split criterion from the combined intermediate result; and creating two or more child nodes of the current node based on the split criterion.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A computer implemented method for growing a plurality of decision or regression trees in parallel, the method comprising: creating, for each of a plurality of trees to be grown, a data bag, each data bag being a derivative of a training data set, the training data set comprising a plurality of data records, the data bags acting as data basis for a respective one of the trees to be grown in a database management system that is in control of a plurality of processing units and of a plurality of data slices, the database management system being operable to process data stored in any one of the data slices by a respective one of the processing units; splitting the training data set into disjoint data sub-sets, each sub-set comprising zero, one or more of the data records of each of the data bags; storing each of the sub-sets in a respective one of the data slices; for each one of the plurality of trees to be grown, creating a respective root node; for each one of the data bags, assigning its data records to the root node of the tree to be grown on said data bag; and growing each of the plurality of trees by: designating the root node as a set of current nodes; for each one of the data slices in parallel, by a respective one of the processing units, performing a single pass through the data records stored in said data slice, thereby identifying one or more of the current nodes having assigned one or more of the data records in said data slice, the identified current nodes belonging to one or more of the trees, and calculating an intermediate result for each of said identified current nodes based on all data records of said data slice assigned to said current node; merging, for each of the identified current nodes, any intermediate results that were calculated for said current node, into a combined intermediate result for said current node; and for each one of the current nodes: calculating a split criterion from the combined intermediate result of said current node; creating two or more child nodes of the current node based on the calculated split criterion; dividing the data records assigned to the current node in dependence on the split criterion; de-assigning each one of the data records from the current node and assigning said data record to one of the child nodes according to said division; and designating the child nodes that were generated by the data-slice-parallel execution as the set of current nodes. 2. The computer-implemented method of claim 1, wherein the assigning of the data records to the root nodes comprises: for each of the sub-sets and for each of the trees to be grown, storing an assignment of the data records of said sub-set to the root node of said tree in the data slice comprising said sub-set, whereby said assignments are updated upon each de-assigning of the data records from one of the current nodes and upon each assigning of the data records to one of the child nodes of said current node. 3. The computer-implemented method of claim 2, wherein the identifying of the one or more of the current nodes having assigned one or more of the data records in the data slices is implemented by evaluating in parallel, by the processing units of the respective data slices, the assignments stored in said data slices. 4. The computer-implemented method claim 1, further comprising: evaluating, for each of the current nodes, one or more stop criteria, thereby taking the combined intermediate result of said current node as input; based on one of the stop criteria being met, stopping processing the current node and removing said current node from the set of current nodes. 5. The computer implemented method claim 1, further comprising: creating a first table, the first table being centrally managed by the database management system; while growing the plurality of trees in parallel, continuously storing and updating the created root nodes and child nodes in the first table, wherein each root node and child node comprises an identifier of its respective tree; after having finished the growing of the plurality of trees, storing the plurality of trees and a model having been derived from a combination of said trees to a non-transitory storage medium; and deleting the first table. 6. The computer implemented method of claim 1, the method further comprising: while growing the plurality of trees in parallel, continuously storing the intermediate results for each of the current nodes in the first table or in a second table in association with the respective current node; and upon having passed all data records in all the data slices in parallel, calculating the combined intermediate results for all the current nodes, storing the combined intermediate results in the first or second table. 7. The computer implemented method of claim 1, further comprising automatically creating each of the data bags by at least one of: splitting the training data sets into disjoint sub-sets; bootstrapping; jackknifing; and using copies of the original training data set as data bags. 8. The computer implemented method of claim 1, wherein assignment of any one of the data records to a current node of any one of the plurality of trees comprises weights, wherein each weight positively correlates with the number of copies of said data record being contained in the data bag acting as the data basis for growing said tree and wherein each weight was randomly assigned to said data record upon creation of the data bags. 9. A computer program product for growing a plurality of decision or regression trees, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processing circuit to cause the processing circuit to: create, for each of a plurality of trees to be grown, a data bag, each data bag being a derivative of a training data set, the training data set comprising a plurality of data records, the data bags acting as data basis for a respective one of the trees to be grown in a database management system that is in control of a plurality of processing units and of a plurality of data slices, the database management system being operable to process data stored in any one of the data slices by a respective one of the processing units; split the training data set into disjoint data sub-sets, each sub-set comprising zero, one or more of the data records of each of the data bags; store each of the sub-sets in a respective one of the data slices; for each one of the plurality of trees to be grown, create a respective root node; for each one of the data bags, assign its data records to the root node of the tree to be grown on said data bag; and grow each of the plurality of trees by: designating the root node as a set of current nodes; for each one of the data slices in parallel, by a respective one of the processing units, performing a single pass through the data records stored in said data slice, thereby identifying one or more of the current nodes having assigned one or more of the data records in said data slice, the identified current nodes belonging to one or more of the trees, and calculating an intermediate result for each of said identified current nodes based on all data records of said data slice assigned to said current node; merging, for each of the identified current nodes, any intermediate results that were calculated for said current node, into a combined intermediate result for said current node; and for each one of the current nodes: calculating a split criterion from the combined intermediate result of said current node; creating two or more child nodes of the current node based on the calculated split criterion; dividing the data records assigned to the current node in dependence on the split criterion; de-assigning each one of the data records from the current node and assigning said data record to one of the child nodes according to said division; and designating the child nodes that were generated by the data-slice-parallel execution as the set of current nodes. 10. The computer program product of claim 9, wherein the assigning of the data records to the root nodes comprises: for each of the sub-sets and for each of the trees to be grown, storing an assignment of the data records of said sub-set to the root node of said tree in the data slice comprising said sub-set, whereby said assignments are updated upon each de-assigning of the data records from one of the current nodes and upon each assigning of the data records to one of the child nodes of said current node. 11. The computer program product of claim 10, wherein the identifying of the one or more of the current nodes having assigned one or more of the data records in the data slices is implemented by evaluating in parallel, by the processing units of the respective data slices, the assignments stored in said data slices. 12. The computer program product of claim 9, further comprising: evaluating, for each of the current nodes, one or more stop criteria, thereby taking the combined intermediate result of said current node as input; based on one of the stop criteria being met, stopping processing the current node and removing said current node from the set of current nodes. 13. The computer program product of claim 9, further comprising: creating a first table, the first table being centrally managed by the database management system; while growing the plurality of trees in parallel, continuously storing and updating the created root nodes and child nodes in the first table, wherein each root node and child node comprises an identifier of its respective tree; after having finished the growing of the plurality of trees, storing the plurality of trees and a model having been derived from a combination of said trees to a non-transitory storage medium; and deleting the first table. 14. The computer program product of claim 9, further comprising: while growing the plurality of trees in parallel, continuously storing the intermediate results for each of the current nodes in the first table or in a second table in association with the respective current node; and upon having passed all data records in all the data slices in parallel, calculating the combined intermediate results for all the current nodes, storing the combined intermediate results in the first or second table. 15. A computer system for growing a plurality of decision or regression trees in parallel, the system comprising: a memory; and a processor, communicatively coupled to said memory, the computer system configured to perform a method comprising: creating, for each of a plurality of trees to be grown, a data bag, each data bag being a derivative of a training data set, the training data set comprising a plurality of data records, the data bags acting as data basis for a respective one of the trees to be grown in a database management system that is in control of a plurality of processing units and of a plurality of data slices, the database management system being operable to process data stored in any one of the data slices by a respective one of the processing units; splitting the training data set into disjoint data sub-sets, each sub-set comprising zero, one or more of the data records of each of the data bags; storing each of the sub-sets in a respective one of the data slices; for each one of the plurality of trees to be grown, creating a respective root node; for each one of the data bags, assigning its data records to the root node of the tree to be grown on said data bag; and growing each of the plurality of trees by: designating the root node as a set of current nodes; for each one of the data slices in parallel, by a respective one of the processing units, performing a single pass through the data records stored in said data slice, thereby identifying one or more of the current nodes having assigned one or more of the data records in said data slice, the identified current nodes belonging to one or more of the trees, and calculating an intermediate result for each of said identified current nodes based on all data records of said data slice assigned to said current node; merging, for each of the identified current nodes, any intermediate results that were calculated for said current node, into a combined intermediate result for said current node; and for each one of the current nodes: calculating a split criterion from the combined intermediate result of said current node; creating two or more child nodes of the current node based on the calculated split criterion; dividing the data records assigned to the current node in dependence on the split criterion; de-assigning each one of the data records from the current node and assigning said data record to one of the child nodes according to said division; and designating the child nodes that were generated by the data-slice-parallel execution as the set of current nodes. 16. The system of claim 15, wherein the assigning of the data records to the root nodes comprises: for each of the sub-sets and for each of the trees to be grown, storing an assignment of the data records of said sub-set to the root node of said tree in the data slice comprising said sub-set, whereby said assignments are updated upon each de-assigning of the data records from one of the current nodes and upon each assigning of the data records to one of the child nodes of said current node. 17. The system of claim 16, wherein the identifying of the one or more of the current nodes having assigned one or more of the data records in the data slices is implemented by evaluating in parallel, by the processing units of the respective data slices, the assignments stored in said data slices. 18. The system of claim 15, further comprising: evaluating, for each of the current nodes, one or more stop criteria, thereby taking the combined intermediate result of said current node as input; based on one of the stop criteria being met, stopping processing the current node and removing said current node from the set of current nodes. 19. The system of claim 15, further comprising: creating a first table, the first table being centrally managed by the database management system; while growing the plurality of trees in parallel, continuously storing and updating the created root nodes and child nodes in the first table, wherein each root node and child node comprises an identifier of its respective tree; after having finished the growing of the plurality of trees, storing the plurality of trees and a model having been derived from a combination of said trees to a non-transitory storage medium; and deleting the first table. 20. The system of claim 15, further comprising: while growing the plurality of trees in parallel, continuously storing the intermediate results for each of the current nodes in the first table or in a second table in association with the respective current node; and upon having passed all data records in all the data slices in parallel, calculating the combined intermediate results for all the current nodes, storing the combined intermediate results in the first or second table.