Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
A Theory of Attributed Equivalence in Databases with Application to Schema Integration
IEEE Transactions on Software Engineering
Semantic vs. structural resemblance of classes
ACM SIGMOD Record
Automated resolution of semantic heterogeneity in multidatabases
ACM Transactions on Database Systems (TODS)
Research problems in data warehousing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Semantic integration of semistructured and structured data sources
ACM SIGMOD Record
Semi-automatic techniques for deriving interscheme properties from database schemes
Data & Knowledge Engineering
Distributed and Parallel Databases
System-Guided View Integration for Object-Oriented Databases
IEEE Transactions on Knowledge and Data Engineering
View Integration: A Step Forward in Solving Structural Conflicts
IEEE Transactions on Knowledge and Data Engineering
Uniform Techniques for Deriving Similarities of Objects and Subschemes in Heterogeneous Databases
IEEE Transactions on Knowledge and Data Engineering
Semantic Dictionary Design for Database Interoperability
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Matching Techniques in Global Schema Design
Proceedings of the First International Conference on Data Engineering
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
ER '93 Proceedings of the 12th International Conference on the Entity-Relationship Approach: Entity-Relationship Approach
Hi-index | 0.00 |
This paper tackles the problem of semi-automatically extracting hyponymy and overlapping properties between entities belonging to heterogeneous database schemes. The technique we propose consists of two phases: the first one derives basic hyponymies and overlappings starting from a specific situation; the second one receives basic properties derived from the first phase and extracts further, more general hyponymies. In addition, the paper reports some experimental results obtained by applying the technique presented here to the database schemes of Italian Central Government Offices. Finally, it shows some applications of derived hyponymies and overlappings; in particular it illustrates how they can influence scheme integration.