Skip to main content
SpringerLink
Log in
Book cover

International Conference on Conceptual Modeling

ER 2006: Advances in Conceptual Modeling - Theory and Practice pp 217–226Cite as

A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 4231))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Chapter  Google Scholar 

  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. 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. 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)

    Chapter  Google Scholar 

  5. Garey, M., Johnson, D.: Computers and Intractability – A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  6. Wang, J.T.L., Zhang, K., Chirn, G.W.: Algorithms for approximate graph matching. Information Sciences 82(1-2), 45–74 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  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. Messmer, B., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. on PAMI 20, 493–505 (1998)

    Google Scholar 

  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. 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. 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. 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. 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. 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. Myers, E.: An O(N D) Difference Algorithm and Its Variations. Algorithmica 1(2), 251–266 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. of Knowledge and Business Engineering, University of Vienna,  

    Johann Eder

  2. Dep. of Informatics-Systems, Alps Adria University Klagenfurt,  

    Karl Wiggisser

Authors
  1. Johann Eder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karl Wiggisser
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Flinders University, Adelaide, Australia

    John F. Roddick

  2. iSOCO, Spain

    V. Richard Benjamins

  3. CEDRIC-CNAM, France

    Samira Si-said Cherfi

  4. University of Cincinnati, USA

    Roger Chiang

  5. Naval Academy Research Institute, Brest Naval, France

    Christophe Claramunt

  6. Department of Computer Science and Engineering, The University of Texas at Arlington, USA

    Ramez A. Elmasri

  7. Dipartimento di Elettronica, Informatica e Sistemistica, Alma Mater Studiorum – Università di Bologna, Italy

    Fabio Grandi

  8. Drexel University, USA

    Hyoil Han

  9. E-Business and Web Science Research Group, Bundeswehr University Munich, Germany

    Martin Hepp

  10. University of Patras, Argolidos 40-42, 153-44, Gerakas Attikis, Greece

    Miltiadis D. Lytras

  11. University of Manitoba, Canada

    Vojislav B. Mišić

  12. Ghent University, Belgium

    Geert Poels

  13. College of Information Science and Technology, Drexel University, USA

    Il-Yeol Song

  14. Department of Software and Computing Systems, University of Alicante, Spain

    Juan Trujillo

  15. EPFL, Switzerland

    Christelle Vangenot

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation