A comparative analysis of methodologies for database schema integration
ACM Computing Surveys (CSUR)
On the agreement of many trees
Information Processing Letters
A Model for XML Schema Integration
EC-WEB '02 Proceedings of the Third International Conference on E-Commerce and Web Technologies
Comparison of Schema Matching Evaluations
Revised Papers from the NODe 2002 Web and Database-Related Workshops on Web, Web-Services, and Database Systems
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
An XML Schema integration and query mechanism system
Data & Knowledge Engineering
INCONSISTENCY OF KNOWLEDGE AND COLLECTIVE INTELLIGENCE
Cybernetics and Systems
A METHOD FOR COMPLEX HIERARCHICAL DATA INTEGRATION
Cybernetics and Systems - KNOWLEDGE PROCESSING METHODOLOGIES IN INTELLIGENT AUTONOMOUS SYSTEMS
Path-Oriented integration method for complex trees
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
| Hi-index | 0.00 |
Hierarchical structures are common in modern applications. Tree integration is one of the tools for them that is not fully researched. We define a complex tree to model other common hierarchical structures. Complex tree integration is parametrized by specific integration criteria. Sub-tree agreement is a group of criteria that describes the relation of sub-tree number and structure between input trees and the integrated tree. This paper provides several definitions of sub-tree agreement, the most important properties of these criteria, and examples of algorithms based on sub-tree agreement.