Abstract: A computer implemented system and method for automated estimation of relationships among a plurality of data elements. The approach includes processing elements of one or more data sets to establish linkage relations among the data records, and then extending the linkage relations based on one or more equivalence relations, stored as linkage data structures. The generated data structures are used for computationally simplifying the data sets by consolidating data records or removing redundancies, such as duplicates, and may be used to yield a compressed data representation or data structure.

Abstract: A computer implemented system and method for automated estimation of relationships among a plurality of data elements. The approach includes processing elements of one or more data sets to establish linkage relations among the data records, and then extending the linkage relations based on one or more equivalence relations, stored as linkage data structures. The generated data structures are used for computationally simplifying the data sets by consolidating data records or removing redundancies, such as duplicates, and may be used to yield a compressed data representation or data structure.

Abstract: A computer implemented system and method for automated estimation of relationships among a plurality of data elements. The approach includes processing elements of one or more data sets to establish linkage relations among the data records, and then extending the linkage relations based on one or more equivalence relations, stored as linkage data structures. The generated data structures are used for computationally simplifying the data sets by consolidating data records or removing redundancies, such as duplicates, and may be used to yield a compressed data representation or data structure.

Abstract: A system for generating a storage-efficient data structure representing a plurality of inter-related data tables and adapted for use in data processing. The system configured to receive input data and generate a graph database having edges and vertices. Each inter-related data table of a plurality of inter-related data tables is received as input data and defines a corresponding vertex of the vertices. The edges defining pairwise relationships between the vertices based on one or more common elements of a corresponding pair of data tables. A reduced graph database is generated, as well as its connected-components. A partition defined by an equivalence relation on the graph database is used to generate the reduced graph database. Each set of the plurality of sets of the partition is represented by a single vertex of the corresponding set. An output data structure indicative of the connected-components, or additionally or alternatively, the irreducible generators, is generated.

Abstract: A computer implemented system and method for automated estimation of relationships among a plurality of data elements. The approach includes processing elements of one or more data sets to establish linkage relations among the data records, and then extending the linkage relations based on one or more equivalence relations, stored as linkage data structures. The generated data structures are used for computationally simplifying the data sets by consolidating data records or removing redundancies, such as duplicates, and may be used to yield a compressed data representation or data structure.