Sergey Melnik

Generic Model Management (eBook, PDF)

Concepts and Algorithms

• Format: PDF

Produktbeschreibung

Many challenging problems in information systems engineering involve the manipulation of complex metadata artifacts or models, such as database schema, interface specifications, or object diagrams, and mappings between models. Applications solving metadata manipulation problems are complex and hard to build. The goal of generic model management is to reduce the amount of programming needed to solve such problems by providing a database infrastructure in which a set of high-level algebraic operators are applied to models and mappings as a whole rather than to their individual building blocks.

This book presents a systematic study of the concepts and algorithms for generic model management. The first prototype of a generic model management system is described, the algebraic operators are introduced and analyzed, and novel algorithms for implementing them are developed. Using the prototype system and the operators presented, solutions are developed for several practically relevant problems, such as change propagation and reintegration.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 244
• Erscheinungstermin: 26. April 2004
• Englisch
• ISBN-13: 9783540246848
• Artikelnr.: 53203947

Autorenporträt

Sergey Melnik, University of Leipzig, Germany

Inhaltsangabe

A Programming Platform for Model Management.- 1. Introduction.- 2. Conceptual Structures and Operators.- 3. Implementation and Applications.- A Semantics for Model Management Operators.- 4. State-Based Semantics.- 5. Change Propagation Scenario.- 6. State-Based Semantics in Rondo.- Schema Matching.- 7. Similarity Flooding Algorithm.- 8. Filters.- 9. Evaluation and Tuning.- Model Management in Perspective.- 10. Related Work.- 11. Conclusions and Outlook.- A. User Study: Gathering Intended Match Results.- B. Proofs of Simplification Theorems.