@article{018e9e59-efa1-719d-9ba7-ee696f8726bb,
author = {Maciej Brzeski, Adam Roman},
title = {Measuring Similarity Between ETL Processes Using Graph Edit Distance},
journal = {Schedae Informaticae},
volume = {2023},
number = {Volume 32},
year = {2023},
issn = {1732-3916},
pages = {9-25},keywords = {ETL process; ETL similarity; graph edit distance; error-tolerant graph matching},
abstract = {Maintaining data warehouses and ETL processes is becoming increasingly difficult. For this reason, we introduce a similarity measure on ETL processes, based on the edit distance of a graph, which models the process. We show both the exact way how to calculate it and heuristic approaches to compute the estimated similarity more quickly. We propose methods to improve graph edit distance based on the assumption that the ETL process model is a directed acyclic graph.},
doi = {10.4467/20838476SI.23.001.19323},
url = {https://ejournals.eu/en/journal/schedae-informaticae/article/measuring-similarity-between-etl-processes-using-graph-edit-distance}
}