We describe an algorithm for detecting semantically equivalent metadata across namespaces instantiated as database schema, an operation otherwise known as schema-matching. Assuming a metadata description discipline which imposes graph-theoretic constraints on data dictionaries, the algorithm employs analytical techniques used in information retrieval, information theory, and computational linguistics. It exploits the information inherent in textual metadata description and metadata dependency relations in order to match elements across schema boundaries. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Coen, G., & Xue, P. (2009). Schema-matching with data dictionaries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5723 LNCS, pp. 62–78). https://doi.org/10.1007/978-3-642-12550-8_6
Mendeley helps you to discover research relevant for your work.