Schema-Matching with data dictionaries

Authors:
Gary Coen;Ping Xue
Affiliations:
Boeing Research and Technology, Seattle, WA;Boeing Research and Technology, Seattle, WA
Venue:
NLDB'09 Proceedings of the 14th international conference on Applications of Natural Language to Information Systems
Year:
2009

Citing 8
Cited 0

Multivariate statistical methods: a primer

Multivariate statistical methods: a primer
Large test collection experiments on an operational, interactive system: Okapi at TREC

TREC-2 Proceedings of the second conference on Text retrieval conference
Automatic sense disambiguation using machine readable dictionaries: how to tell a pine cone from an ice cream cone

SIGDOC '86 Proceedings of the 5th annual international conference on Systems documentation
Database lexicography

Data & Knowledge Engineering
Dictionaries and Lexical Graphs

NLDB'01 Proceedings of the 6th International Workshop on Applications of Natural Language to Information Systems
Generic Schema Matching with Cupid

Proceedings of the 27th International Conference on Very Large Data Bases
A survey of approaches to automatic schema matching

The VLDB Journal — The International Journal on Very Large Data Bases
Automatic Information Organization and Retrieval.

Automatic Information Organization and Retrieval.

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.