1. A computer implemented method comprising: displaying an initial information integration flow graph; prompting a user to select a transition from a list of transitions consisting of: swap (SWA), distribution (DIS), partitioning (PAR), replication (REP), factorization (FAC), add recovery point (aRP) and add shedding (aAP) to consider in satisfying a plurality of optimization objectives; receiving the user's selection of at least two transitions from the list of transitions; for each transition selected, applying a respective transition of the at least two transitions to the initial information integration flow graph to form a respective modified information integration flow graph, the modified information integration flow graphs being functionally equivalent to the initial information integration flow graph; selectively displaying each respective modified information integration flow graph with the initial information integration flow graph; and concurrently visibly displaying a family tree of flow paths, wherein each flow path connects a respective modified information integration flow graph of the plurality of modified information integration flow graphs to the initial information integration flow graph, each modified information integration flow graph being represented by a respective single icon within the family tree and a label indicating the applied transition; determining which modified information integration flow graph satisfies the plurality of optimization objectives; and selecting the modified information integration flow graph that satisfies the plurality of optimization objectives at the lowest cost.