A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing

  • Johann Eder
  • Karl Wiggisser
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4231)


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.


Directed Acyclic Graph Data Warehouse Graph Match Edit Operation Comparison Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Eder, J., Koncilia, C., Mitsche, D.: Automatic Detection of Structural Changes in Data Warehouses. In: Proc. of the 5th DaWaK (2003)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Garey, M., Johnson, D.: Computers and Intractability – A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  6. 6.
    Wang, J.T.L., Zhang, K., Chirn, G.W.: Algorithms for approximate graph matching. Information Sciences 82(1-2), 45–74 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Messmer, B., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. on PAMI 20, 493–505 (1998)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Gori, M., Maggini, M., Sarti, L.: Exact and approximate graph matching using random walks. IEEE Trans. on PAMI 27(7), 1100–1111 (2005)Google Scholar
  13. 13.
    Chawathe, S., Rajaraman, A., Garcia-Molina, H., Widom, J.: Change detection in Hierarchically Structured Information. In: Proc. of the ACM SIGMOD (1996)Google Scholar
  14. 14.
    Chawathe, S., Garcia-Molina, H.: Meaningful change detection in structured data. In: Proceedings of the 1997 ACM SIGMOD, pp. 26–37 (1997)Google Scholar
  15. 15.
    Myers, E.: An O(N D) Difference Algorithm and Its Variations. Algorithmica 1(2), 251–266 (1986)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Johann Eder
    • 1
  • Karl Wiggisser
    • 2
  1. 1.Dep. of Knowledge and Business EngineeringUniversity of Vienna 
  2. 2.Dep. of Informatics-SystemsAlps Adria University Klagenfurt 

Personalised recommendations