On the cardinality of schema matching

Authors:
Avigdor Gal
Affiliations:
Technion – Israel Institute of Technology, Haifa, Israel
Venue:
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
Year:
2005

Citing 12
Cited 3

Efficient algorithms for finding maximum matching in graphs

ACM Computing Surveys (CSUR)
Unsolvable problems related to the view integration approach

Proceedings on International conference on database theory
The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
Federated database systems for managing distributed, heterogeneous, and autonomous databases

ACM Computing Surveys (CSUR) - Special issue on heterogeneous databases
Managing semantic heterogeneity in databases: a theoretical prospective

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimizing Multi-Feature Queries for Image Databases

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Generic Schema Matching with Cupid

Proceedings of the 27th International Conference on Very Large Data Bases
PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A survey of approaches to automatic schema matching

The VLDB Journal — The International Journal on Very Large Data Bases
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Automatic ontology matching using application semantics

AI Magazine - Special issue on semantic integration
COMA: a system for flexible combination of schema matching approaches

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

Why is schema matching tough and what can we do about it?

ACM SIGMOD Record
Rank Aggregation for Automatic Schema Matching

IEEE Transactions on Knowledge and Data Engineering
OntoMatch: a monotonically improving schema matching system for autonomous data integration

IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss aspects of cardinality constraints in schema matching. A new cardinality classification is proposed, emphasizing the challenges in schema matching that evolve from cardinality constraints. We also offer a new research direction for automating schema matching to manage cardinality constraints.