TY - JOUR
TI - Measuring Similarity Between ETL Processes Using Graph Edit Distance
AU - Brzeski, Maciej
AU - Roman, Adam
TI - Measuring Similarity Between ETL Processes Using Graph Edit Distance
AB - 
	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.
VL - 2023
IS - Volume 32
PY - 2023
SN - 1732-3916
C1 - 2083-8476
SP - 9
EP - 25
DO - 10.4467/20838476SI.23.001.19323
UR - https://ejournals.eu/en/journal/schedae-informaticae/article/measuring-similarity-between-etl-processes-using-graph-edit-distance
KW - ETL process
KW - ETL similarity
KW - graph edit distance
KW - error-tolerant graph matching