Abstract: A data integration system is disclosed that incorporates one or more techniques for eases the design and maintenance of a mapping. As components are added to an existing design, the data integration system removes the need to specify all input and output attributes. In one aspect, components types are implement that allow entity relationships to be added and/or edited in a flow view of a logical design. Therefore, attributes of components representing datasets can be added and propagated to downstream components with minimal effort on the part of a map designer.

Abstract: A data integration system is disclosed that incorporates one or more techniques for eases the design and maintenance of a mapping. As components are added to an existing design, the data integration system removes the need to specify all input and output attributes. In one aspect, components types are implement that allow entity relationships to be added and/or edited in a flow view of a logical design. Therefore, attributes of components representing datasets can be added and propagated to downstream components with minimal effort on the part of a map designer.

Abstract: A technique for archiving a relational database having tables of rows may use clusters. Transaction identifiers may be assigned to each of the rows in each of the tables such that all rows belonging to the same application transaction share a unique transaction identifier. Plural hierarchies may be determined, each hierarchy having high level nodes corresponding to the rows in a single table and dependent nodes corresponding to rows in other tables to which the rows in the single table are related in the database. The plural hierarchies may be merged to form plural clusters, one cluster for each unique transaction identifier. Each cluster may have high level nodes corresponding to the plural hierarchies but only those dependent nodes from the plural hierarchies whose transaction identifiers correspond to that of the cluster. The clusters may be stored in one or more files to form an archive.

Abstract: A technique for archiving a relational database having tables of rows may use clusters. Transaction identifiers may be assigned to each of the rows in each of the tables such that all rows belonging to the same application transaction share a unique transaction identifier. Plural hierarchies may be determined, each hierarchy having high level nodes corresponding to the rows in a single table and dependent nodes corresponding to rows in other tables to which the rows in the single table are related in the database. The plural hierarchies may be merged to farm plural clusters, one cluster for each unique transaction identifier. Each cluster may have high level nodes corresponding to the plural hierarchies but only those dependent nodes from the plural hierarchies whose transaction identifiers correspond to that of the cluster. The clusters may be stored in one or more files to form an archive.