The Web is a huge container of digital resources, that is, sets of objects that are accessible and manageable by a computer. When dealing with structured queries (rather than with flat list of keywords), model matchmaking is a fundamental task in the digital resource discovery process. This paper presents MAGDA (MApping Generic Discovery Architecture), a reference architecture designed to implement different matchmaking algorithms aimed at defining mappings between digital resource models. The basic conceptual structures of MAGDA are described: a labeled oriented multigraph as reference model, model mappings, generic matchmakers and matchmaking techniques. Finally, MAGDA is used to support the definition and use of three different discovery solutions.
Digital Resource Discovery: Semantic Annotation and Matchmaking Techniques
D. Bianchini;CASTANO, Silvana;V. De Antonellis;
2006-01-01
Abstract
The Web is a huge container of digital resources, that is, sets of objects that are accessible and manageable by a computer. When dealing with structured queries (rather than with flat list of keywords), model matchmaking is a fundamental task in the digital resource discovery process. This paper presents MAGDA (MApping Generic Discovery Architecture), a reference architecture designed to implement different matchmaking algorithms aimed at defining mappings between digital resource models. The basic conceptual structures of MAGDA are described: a labeled oriented multigraph as reference model, model mappings, generic matchmakers and matchmaking techniques. Finally, MAGDA is used to support the definition and use of three different discovery solutions.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.