Titlebook: Generic Model Management; Concepts and Algorit Sergey Melnik Book 2004 Springer-Verlag Berlin Heidelberg 2004 algorithms.conceptual structu

權(quán)宜之計(jì)

Osmosis

1. Introductionject of this work. The deficiencies of today’s metadata management techniques are examined in Sect. 1.2. In Sect. 1.3, we sketch the approach to metadata management explored in the dissertation, called generic model management, and formulate our main objectives. An overview of the structure and cont

機(jī)密

4. State-Based Semanticsd problems. Using Rondo, we developed scripts for several practically relevant scenarios, such as change propagation, view reuse, and reintegration. We found that the scripts produce intuitively correct results and that the structural operator definitions that we give are useful for solving practica

癡呆

有惡臭

arcane

spinal-stenosis

8. Filtersimilarity Flooding algorithm. Usually, for every element in the matched models, the algorithm delivers a large set of match candidates. Hence, the immediate result of the fixpoint computation may still be too voluminous for many matching tasks. For instance, in a schema matching application the choi

DEAWL

10. Related Work 1959) to database design (Wiederhold 1977), from storing schemas and queries as first-class objects (Stonebraker et al. 1984; den Bussche et al. 1993; Lakshmanan et al. 2001), to transforming them using complex algorithms (Abiteboul et al. 1995; Halevy 2001).

Mri485

11. Conclusions and Outlooke models are complicated and hard to build. The goal of generic model management is to reduce the cost of developing such applications by raising the level of abstraction of model manipulation operations.

DUCE