Abstract
In this chapter we examine several filters that can be used for choosing the best match candidates from the list of ranked map pairs returned by the Similarity 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 choice presented to a human user for every schema element may be overwhelming, even when the presented match candidates are ordered by rank. We refer to the immediate result of the iterative computation as multimapping, since it contains many potentially useful mappings as subsets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Melnik, S. (2004). 8. Filters. In: Generic Model Management. Lecture Notes in Computer Science, vol 2967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24684-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24684-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21980-4
Online ISBN: 978-3-540-24684-8
eBook Packages: Springer Book Archive