Abstract
Comparing versions of graph-based workflows can present challenges, as methods relying on volatile identifiers may interpret a node rename as separate deletion and addition operations, while other structural comparison techniques can be computationally expensive. Systems and methods are described for semantic comparison using a multi-pass reconciliation algorithm that employs functional fingerprinting. This process can involve generating a content-based hash value for each node after programmatically excluding non-semantic data, such as unique identifiers and graphical coordinates. By comparing these fingerprints, a system can identify nodes that were renamed. This approach can facilitate a linear-time semantic reconciliation of workflow graphs, providing a representation of changes that distinguishes between node modifications and structural renames, which may improve the tracking of a workflow's logical evolution.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Singhal, Rishabh and Kalyan, Vijai, "Semantic Graph Reconciliation Using Functional Fingerprinting", Technical Disclosure Commons, ()
https://www.tdcommons.org/dpubs_series/11416