A method for efficient traversal of an indexed subset of a multi-dimensional dataset capable of being indexed in ravel order
Original Publication Date: 2009-Jun-29
Included in the Prior Art Database: 2009-Jun-29
This is a technique for efficient iteration over the members of an indexed sub-array of a multidimensional array. It is useful in multidimensional analysis to be able to access in turn all the element of a sub-array specified by a set of indices on each axis. This technique gives an efficient means of moving through the elements of the sub-array in turn as if it were a normal array. It also allows reordering and combining of dimensions and also scatter-point indexing. This kind of traversal is useful when combining data of different structures, such as in a query aggregator, and in performing structural transformations on data held in memory, such as in the transform phase of an extract-transform-load (ETL) process. It shows most benefits when applied to large datasets of many dimensions. It can be implemented simply in any traditional computer language.