In view of the defects of Hyperledger Fabric in the sorting stage, an optimization scheme of graph sorting based on the corresponding comparison graph is proposed. As the corresponding comparison has a graph merging process with correlation invariance and a short algorithm running time, a topological algorithm based on transaction importance is designed to reduce the serialization conflict caused by the default sequence sorting. The experiments and analysis show that this scheme effectively solves the serialization conflict problem of the original scheme, reduces the proportion of invalid transactions in the system, improves the transaction efficiency of the system, and saves a lot of computing and storage resources.