Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Constraint programming and database languages: a tutorial
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Discovering Conceptual Differences among Different People via Diverse Structures
PAKDD '99 Proceedings of the Third Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining
Indexing pictorial documents by their content: a survey of current techniques
Image and Vision Computing
| Hi-index | 0.00 |
In order to simplify the reconciliation of two heterogeneous tree databases, we must minimize the number of crossovers in a directed graph constructed using two subtrees selected from the databases. This paper proposes a method for minimizing the number of crossovers in the directed graph. To find the directed graph with the minimum number of crossovers, the method maintains zero-crossovers in each ordered subtree. The resulting directed graph is defined as a semi-optimal solution satisfying the zero-crossover constraint for edges connecting two leaf sequences. It is computed by changing the order of non-leaf nodes in each hierarchical level of the ordered tree and swapping leaf nodes in each of the two leaf layers. To maintain the zero-crossover constraint for each ordered tree in the matrix transformation, the method also finds the two leaf clusters that contain half of the leaf nodes and swaps the leaf clusters.