Abstract
We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of change detection in temporal data warehouses and inspired by a well known tree comparison algorithm, we developed a heuristic method to calculate an edit script transforming an old version of a graph to the new one. This edit script is composed of operations for inserting and deleting nodes and changing labels and values of nodes as well as for inserting and deleting edges to cover rearrangements of nodes (moves). We present the prerequisites of our approach, the different phases of the algorithm and discuss some evaluation results gained from a prototypic implementation. Our approach is applicable to arbitrary labeled DAGs in any context, but optimized for rooted, ordered and labeled acyclic digraphs with a small rate of changes between the DAGs to be compared.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Eder, J., Koncilia, C.: Changes of Dimension Data in Temporal Data Warehouses. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2001. LNCS, vol. 2114, pp. 284–293. Springer, Heidelberg (2001)
Eder, J., Koncilia, C., Mitsche, D.: Automatic Detection of Structural Changes in Data Warehouses. In: Proc. of the 5th DaWaK (2003)
Eder, J., Koncilia, C., Wiggisser, K.: Maintaining temporal warehouse models. In: Proc. of the IFIP Int’l Conf. on Research and Practical Issues of Enterprise Information Systems (2006)
Eder, J., Koncilia, C., Wiggisser, K.: A Tree Comparison Approach to Detect Changes in Data Warehouse Structures. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, pp. 1–10. Springer, Heidelberg (2005)
Garey, M., Johnson, D.: Computers and Intractability – A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
Wang, J.T.L., Zhang, K., Chirn, G.W.: Algorithms for approximate graph matching. Information Sciences 82(1-2), 45–74 (1995)
Zhang, K., Wang, J., Sasha, D.: On the editing distance between undirected acyclic graphs. Int’l Journal of Foundations of Computer Science 7(13) (1996)
Messmer, B., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. on PAMI 20, 493–505 (1998)
Shoubridge, P., Kraetzl, M., Ray, D.: Detection of abnormal change in dynamic networks. In: Proc. of Information Decision and Control, pp. 557–562. IEEE Inc., Los Alamitos (1999)
Cordella, L., et al.: Perfomance evaluation of the vf graph matching algorithm. In: Proc. of the 10th Int’l Conf. on Image Analysis and Processing, pp. 1172–1177 (1999)
Hlaoui, A., Wang, S.: A new algorithm for inexact graph matching. In: Proc. of the 16th Int’l Conf. on Pattern Recognition (ICPR 2002), vol. 4 (2002)
Gori, M., Maggini, M., Sarti, L.: Exact and approximate graph matching using random walks. IEEE Trans. on PAMI 27(7), 1100–1111 (2005)
Chawathe, S., Rajaraman, A., Garcia-Molina, H., Widom, J.: Change detection in Hierarchically Structured Information. In: Proc. of the ACM SIGMOD (1996)
Chawathe, S., Garcia-Molina, H.: Meaningful change detection in structured data. In: Proceedings of the 1997 ACM SIGMOD, pp. 26–37 (1997)
Myers, E.: An O(N D) Difference Algorithm and Its Variations. Algorithmica 1(2), 251–266 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eder, J., Wiggisser, K. (2006). A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing. In: Roddick, J.F., et al. Advances in Conceptual Modeling - Theory and Practice. ER 2006. Lecture Notes in Computer Science, vol 4231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908883_27
Download citation
DOI: https://doi.org/10.1007/11908883_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47703-7
Online ISBN: 978-3-540-47704-4
eBook Packages: Computer ScienceComputer Science (R0)