Patent ID: 8429108
Filing Date: 2013-04-23
Classification: G06F

Abstract:
1. A fast computer-implemented method for computing compact numerical (Omicron,Iota) isomorphism certificates for one or more poset-representable digital data objects D.sub. 1 , . . . D.sub.n with inherent poset structures P.sub. 1 , . . . P.sub.n, providing means for certifying isomorphism between two poset structures, if their corresponding (Omicron,Iota) certificates match, thus enabling structure-based access to complex and large data sets, as well as comparison, sorting and clustering thereof to be performed by efficient numerical operations on said certificates derived from and representing the data objects contained in these data sets, comprising successively for j=1, . . . n, the steps of: loading a poset-representable digital data object D.sub.j and extracting the inherent poset structure P.sub.j; computing the isomorphism certificate (Omicron(P.sub.j),Iota(P.sub.j)) for the poset P.sub.j; storing the isomorphism certificate (Omicron(P.sub.j),Iota(P.sub.j)) in a storage medium, wherein a poset-representable data object D.sub.j can be construed as being composed of a set of components c.sub. and further wherein for each poset P.sub.j: (Omicron(P.sub.j),Iota(P.sub.j)) a pair of number sequences is designated whose total length is proportional to the number of edges in P.sub.j, and the code Iota(P.sub.j) is a concatenation of r sorted sequences Iota(P,c.sub. and further wherein the (Omicron(P.sub.j),Iota(P.sub.j)) certificate canonically represents a set of poset-representable digital data objects in the plurality D.sub.