Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
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
An automatic technique for detecting type conflicts in database schemes
Proceedings of the seventh international conference on Information and knowledge management
Semi-automatic techniques for deriving interscheme properties from database schemes
Data & Knowledge Engineering
Intensional and extensional integration and abstraction of heterogeneous databases
Data & Knowledge Engineering
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
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
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
ER '93 Proceedings of the 12th International Conference on the Entity-Relationship Approach: Entity-Relationship Approach
COOPIS '99 Proceedings of the Fourth IECIS International Conference on Cooperative Information Systems
| Hi-index | 0.00 |
This paper tackles the problem of semi-automatically extracting hyponymy and overlapping properties between entities belonging to pre-existing database schemes. The algorithm we propose consists of two phases: the first one derives basic hyponymies and overlappings starting from a particular scenario; the second one takes in input basic properties derived by the first phase and extracts further, more general hyponymies. In addition the paper shows some applications of derived hyponymies and overlappings.