A METHOD FOR COMPLEX HIERARCHICAL DATA INTEGRATION
- 1 June 2011
- journal article
- research article
- Published by Taylor & Francis in Cybernetics and Systems
- Vol. 42 (5) , 358-378
Abstract
The process of integrating data in a hierarchical structure is usually based on algorithms designed for one specific task; for example, for eXtendable Markup Language (XML) schema integration. In this article, a more general approach for integration of data in a hierarchical structure is proposed using a generalized tree structure called a complex tree. For this aim we define a set of criteria for integration. These criteria are completeness, precision, and optimality. A simple algorithm based on these criteria is presented and the advantages of the approach are discussed.Keywords
This publication has 20 references indexed in Scilit:
- Ontology-Based Administration of Web Directories2010
- A HYBRID METHOD FOR INTEGRATING MULTIPLE ONTOLOGIESCybernetics and Systems, 2009
- An XML Schema integration and query mechanism systemData & Knowledge Engineering, 2008
- Integration of cadastral and financial-accounting systemsInternational Journal of Intelligent Information and Database Systems, 2008
- On the agreement of many treesInformation Processing Letters, 1995
- Constraint confrontation: An important step in view integration1992
- A comparative analysis of methodologies for database schema integrationACM Computing Surveys, 1986
- The median procedure for n-treesJournal of Classification, 1986
- N-trees as nestings: Complexity, similarity, and consensusJournal of Classification, 1986
- Optimal algorithms for comparing trees with labeled leavesJournal of Classification, 1985