Presentation 1999/11/18
Constraint Solver for Reconciling Heterogeneous Tree Databases
Hajime Kitakami, Mitsuko Nishimoto,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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. The method defines an interconnection matrix between two leaf layers. To find the directed graph with the minimum number of crossovers, the method maintains zero-crossovers in each ordered subtree. In addition, this paper reports both a heuristics to minimize the crossovers and its performance evaluation.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) heterogeneous trees / reconciliation / constraint solver / taxonomic tree / genetic tree
Paper # AI99-55
Date of Issue

Conference Information
Committee AI
Conference Date 1999/11/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Constraint Solver for Reconciling Heterogeneous Tree Databases
Sub Title (in English)
Keyword(1) heterogeneous trees
Keyword(2) reconciliation
Keyword(3) constraint solver
Keyword(4) taxonomic tree
Keyword(5) genetic tree
1st Author's Name Hajime Kitakami
1st Author's Affiliation Hiroshima City University()
2nd Author's Name Mitsuko Nishimoto
2nd Author's Affiliation Hiroshima City University
Date 1999/11/18
Paper # AI99-55
Volume (vol) vol.99
Number (no) 446
Page pp.pp.-
#Pages 7
Date of Issue