3 citations found. Retrieving documents...
I. Schmitt and G. Saake. Merging Inheritance Hierarchies for Schema Integration based on Concept Lattices. Preprint Nr. 2, Fakultat fur Informatik, Universitat Magdeburg, Feb. 1997.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Architectural Synthesis: Integrating Multiple Architectural.. - Waters, Abowd (1999)   (3 citations)  (Correct)

....[20] that uses a constraint algorithm to limit the search space and allow graph matching to find architectural patterns. This technique holds promise to allow graph level matching of perspectives. Finally, the area of concept analysis has received much attention of late in reverse engineering [34]. If we use elements as objects and domain terms as attributes, we can build a concept lattice representing the perspectives under union. We are presently refining an algorithm that traverses the lattice and detects our five relations. The analyst then uses this information to combine the ....

I. Schmitt and G. Saake, "Merging Inheritance Hierarchies for Schema Integration based on Concept Lattices," Universitat Magdeburg, Magdeburg, Germany, Technical Report 1997.


Refining Extensional Relationships and Existence Requirements .. - Schmitt, Türker (1998)   (1 citation)  Self-citation (Schmitt)   (Correct)

....inheritance can be used recursively to derive classes from derived classes, e.g. to derive the class P123 from the classes P12 and P 23. As a result, a recursive usage of upward inheritance may lead to an explosion of the number of derived classes. Therefore, we proposed an integration method [SS96b, SS96a, SS97] basing on a base extension set which is determined by the extensional relationships obtained during the extension analysis. Due to the fact that the designer often cannot overview all existing (relevant) extensional relationships of the universe of discourse at once, we suggest an incremental ....

....Type P3 = f1; 2; 5; 6g Manufacturer P1 = f2; 3; 4; 5; 6; 7g Figure 2.5: Complete Integrated Schema The correct and complete integrated schema according to the given correct and complete set of base extensions is depicted in Figure 2.5. This integrated schema derived by the algorithm described in [SS97]. The root class contains all objects of the universe of discourse (union of all base extensions) These objects have the attribute Name in common. The root class has three subclasses M , P 1, and P3 which contain the same 6 objects as the original classes with these names. The further ....

[Article contains additional citation context not shown here]

I. Schmitt and G. Saake. Merging Inheritance Hierarchies for Schema Integration based on Concept Lattices. Preprint 2, Fakultat fur Informatik, Universit at Magdeburg, February 1997. Also available via http://wwwiti.cs.unimagdeburg. de/publikationen/97/SS97.ps.gz.


Domain-Specific Metamodels for Heterogeneous Information.. - Tan, Zaslavsky, Ewald.. (2003)   (Correct)

No context found.

I. Schmitt and G. Saake. Merging Inheritance Hierarchies for Schema Integration based on Concept Lattices. Preprint Nr. 2, Fakultat fur Informatik, Universitat Magdeburg, Feb. 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC