6. A computer system for translating data from a hierarchical data structure to a relational data structure, the computer system comprising: a converter for: defining at least one shredding tree that each translate a hierarchical data structure into a relational data structure, each of the at least one shredding tree defining a hierarchical data structure comprising at least one cursor node and at least one data node, wherein each of the at least one cursor node defines, in conjunction with parent cursor nodes, a column within the relational data structure, and each of the at least one data node being an immediate child of a respective parent cursor node within the at least one cursor nodes, each of the at least one data node comprising a respective data element to be inserted at the column defined by the respective parent cursor node; reading at least one data element from a subset of the at least one data node of a first part of a hierarchical data structure instance using a tree traversal algorithm defined by the at least one shredding tree; maintaining: a set of tree commit counter, each tree commit counter being associated with a respective shredding tree within the at least one shredding tree; and a global commit counter; decrementing, in response to the storing, a current tree commit counter within the set of tree commit counters, the current tree commit counter being associated with the current shredding tree; and decrementing, in response to the storing, the global commit counter; a first storage for storing the at least one data element in a first storage according to the relational data structure defined by a current shredding tree comprising the at least one data node containing the at least one data element; and a relational database controller for determining, in response to the storing, that the first storage stores a quantity of data that is greater than a threshold and that at least one of a tree commit counter within the set of tree commit counters and the global commit counter has been decremented to zero, and for, in response to the determining, transferring data stored in the first storage to a relational data structure according to the mapping.
6. A computer system for translating data from a hierarchical data structure to a relational data structure, the computer system comprising: a converter for: defining at least one shredding tree that each translate a hierarchical data structure into a relational data structure, each of the at least one shredding tree defining a hierarchical data structure comprising at least one cursor node and at least one data node, wherein each of the at least one cursor node defines, in conjunction with parent cursor nodes, a column within the relational data structure, and each of the at least one data node being an immediate child of a respective parent cursor node within the at least one cursor nodes, each of the at least one data node comprising a respective data element to be inserted at the column defined by the respective parent cursor node; reading at least one data element from a subset of the at least one data node of a first part of a hierarchical data structure instance using a tree traversal algorithm defined by the at least one shredding tree; maintaining: a set of tree commit counter, each tree commit counter being associated with a respective shredding tree within the at least one shredding tree; and a global commit counter; decrementing, in response to the storing, a current tree commit counter within the set of tree commit counters, the current tree commit counter being associated with the current shredding tree; and decrementing, in response to the storing, the global commit counter; a first storage for storing the at least one data element in a first storage according to the relational data structure defined by a current shredding tree comprising the at least one data node containing the at least one data element; and a relational database controller for determining, in response to the storing, that the first storage stores a quantity of data that is greater than a threshold and that at least one of a tree commit counter within the set of tree commit counters and the global commit counter has been decremented to zero, and for, in response to the determining, transferring data stored in the first storage to a relational data structure according to the mapping. 9. The computer system of claim 6 , wherein the converter is further adapted to: completely traversing all node of the current shredding tree; and decrementing, in response to completely traversing the current shredding tree, the global commit counter by a value remaining in the current tree commit counter.