Patent ID: 6738762
Filing Date: 2004-05-18
Classification: G06F,Y10S

Abstract:
A method of preprocessing a multidimensional data set comprising a plurality of N data elements in the form of tuples to create a pruned suffix tree structure including hashing signatures to represent each node in the pruned suffix tree, the method comprising the steps of:a) creating a suffix tree for each dimension of data in an n-dimensional data set, forming a plurality of n suffix trees; b) storing, for each node in each suffix tree, an exact count of a row identifiers of each data element comprising the substring associated with the node; c) pruning each suffix tree to remove nodes with a row identifier count below a predetermined value; d) hashing, for each node in each pruned suffix tree, the row identifiers to generate, a fixed-length signature for the associated node; and e) storing, for each node in each pruned suffix tree, the hashing signature generated in step d).