Holistic Query Interface Matching using Parallel Schema Matching

Authors:
Weifeng Su;Jiying Wang;Frederick Lochovsky
Affiliations:
University of Science and Technology, Hong Kong;City University, Hong Kong;University of Science and Technology, Hong Kong
Venue:
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Year:
2006

Citing 0
Cited 4

PORSCHE: Performance ORiented SCHEma mediation

Information Systems
Performance oriented schema matching

DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Clustering Wikipedia infoboxes to discover their types

Proceedings of the 21st ACM international conference on Information and knowledge management
Towards a More Scalable Schema Matching: A Novel Approach

International Journal of Distributed Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using query interfaces of different Web databases, we propose a new complex schema matching approach, Parallel Schema Matching (PSM). A parallel schema is formed by comparing two individual schemas and deleting common attributes. The attribute matching can be discovered from the attribute-occurrence patterns if many parallel schemas are available. A count-based greedy algorithm identifies which attributes are more likely to be matched. Experiments show that PSM can identify both simple matching and complex matching accurately and efficiently.