Generic Model Management: Concepts and Algorithms

Front Cover
Springer Science & Business Media, Apr 28, 2004 - Computers - 238 pages

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.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Selected pages

Contents

Introduction
3
12 The Problem
5
13 A Vision for Management of Complex Models
6
14 Outline and Contributions of the Dissertation
9
Conceptual Structures and Operators
13
22 Conceptual Structures
18
221 Models
19
222 Morphisms
20
72 Similarity Flooding Algorithm
122
722 Fixpoint Computation
123
73 Generalized Version of the Algorithm
124
74 Convergence and Complexity of the Algorithm
126
75 Features of the Algorithm by Example
127
751 Semistructured Data
128
752 XML Schemas
129
753 Matching XML Schemas Using Instance Data
131

223 Selectors
22
231 Primitive Operators
23
232 Derived Operators
25
233 Extract and Delete
26
234 Match
27
235 Merge
28
Implementation and Applications
29
32 Operators
30
322 Dependencies
32
323 ExtractMin
33
324 DeleteHard and DeleteSoft
35
325 Diff
36
326 Match
37
327 Merge
38
33 Prototype Rondo
42
34 ViewReuse Scenario
45
35 Reintegration Scenario
47
36 Conclusions
50
A Semantics for Model Management Operators
52
StateBased Semantics
55
41 Basic Concepts
56
412 Mappings
58
413 Formal Notation
60
414 Semantics of Scripts
61
415 Preliminaries
62
42 Operators
64
421 Compose Operator
65
422 Invert Operator
67
423 Extract Operator
68
424 Merge Operator
73
425 Diff Operator
77
426 Confluence Operator
84
427 Match Operator
85
43 Materialization
86
Change Propagation Scenario
90
51 Propagating Additions
92
52 Propagating Deletions
93
53 A General Solution
95
54 Schema Evolution Scenario
96
55 Variants of Change Propagation
98
StateBased Semantics in Rondo
101
62 Semantics of Selectors
105
63 Structural vs StateBased Operators
106
64 Revisiting Change Propagation
109
65 Conclusions
112
Schema Matching
114
Similarity Flooding Algorithm
117
71 Overview of the Approach
119
754 Finding Related Data
134
Filters
136
81 Constraints
138
82 Selection Metrics
139
83 FilterBest Algorithm
142
84 Expressing FilterBest in SQL
144
Evaluation and Tuning
147
91 Matching Accuracy
148
92 Intended Match Result
150
93 User Study
151
94 Evaluation of Algorithm and Filters
153
95 Propagation Coefficients
155
96 Conclusions and Open Issues
156
Model Management in Perspective
160
Related Work
163
101 Data Integration and Merge
164
1011 Schema Integration
165
1012 Answering Queries Using Views
170
102 Schema Matching and Match
173
103 Mapping Composition and Compose
178
104 View Selection and Extract
181
105 View Complement and Diff
182
106 Approaches to Specifying Semantics
184
1062 Information Capacity
186
1063 Category Theory
187
107 Metadata Repositories
189
108 MetadataIntensive Applications
190
1082 Change Propagation
193
109 Other Related Work
195
Conclusions and Outlook
198
112 Concluding Discussion
200
113 Open Technical Challenges
205
1133 Completeness and Redundancy
206
1134 Nary Mappings
209
1135 Formalization of ModelManagement Problems
210
User Study
213
A1 BizTalk Schemas XML
214
A2 Property Listing Schemas XML
215
A5 University Schemas with Data Instances XML
216
A6 Catalogs with Data Instances XML
217
A7 Personnel Schemas Relational
219
A9 PersonnelUniversity Schemas Relational
220
Proofs of Simplification Theorems
221
B2 Merge Operator
223
B3 Diff Operator
225
References
229
Copyright

Other editions - View all

Common terms and phrases