• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Study on Constraint Query Processing for Heterogeneous Tree Databases

Research Project

Project/Area Number 12680394
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Intelligent informatics
Research InstitutionHiroshima City University

Principal Investigator

KITAKAMI Hajime  Hiroshima City University, Information Sciences, Professor, 情報科学部, 教授 (50234240)

Co-Investigator(Kenkyū-buntansha) KUROKI Susumu  Hiroshima City University, Information Sciences, Associative Professor, 情報科学部, 助教授 (20225288)
FUJI Ren  Tokushima University, Engineering, Professor, 工学部, 教授 (20264947)
Project Period (FY) 2000 – 2002
Project Status Completed (Fiscal Year 2002)
Budget Amount *help
¥3,100,000 (Direct Cost: ¥3,100,000)
Fiscal Year 2002: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 2001: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 2000: ¥1,400,000 (Direct Cost: ¥1,400,000)
KeywordsConstraint Database / Ordered Tree / Reconciliation / Heterogeneous Tree / Genetic Algorithm / Taxonomy / Parallel Processing / Depth-First Search / 調停グラフ / 階層グラフ / 異種木構造 / クラスタ交換法 / ビジュアル化 / ビジュアルデータベース / 系統樹
Research Abstract

This is a study of heterogeneous databases, which includes structures such as the taxonomic tree and conceptual hierarchy. In a study of effective constraint-query processing in two heterogeneous tree databases, we obtained the following results :
(1) A constraint query is represented by the selection of a subtree from each database and a minimum of computational crossover for a hierarchical graph constructed using two subtrees selected from two databases. Moreover, the constraint query, which is represented as the minimum of computational crossover, is different from the existing spatial query, which is a kind of constraint query that is processed by geometrical reasoning in spatial databases.
(2) In order to minimize the computational crossover for the graph, an interconnection matrix defined by us is constructed with a constraint between two leaf layers in two subtrees, and the matrix approaches a unit matrix from its initial status using matrix transformations. We found that our depth-first search is useful to approach the unit matrix. The depth-first search does not allow creating any crossover among the branches of each subtree.
(3) We designed a user interface implemented in JAVA, to visualize the result of the constraint query. We found that the interface is easy to use for the results of constraint query.
(4) In order to achieve faster computation to find minimum crossovers, we considered using a genetic algorithm. As a result, combining the depth-first search with the genetic algorithm was useful for the improvement of computational speed.
(5) A very large database is required to enhance the processing of a constraint query. We considered parallel and distributed processing for a. depth-first search on multiple computers. As a result, we obtained good performance on the computers.

Report

(4 results)
  • 2002 Annual Research Report   Final Research Report Summary
  • 2001 Annual Research Report
  • 2000 Annual Research Report
  • Research Products

    (25 results)

All Other

All Publications (25 results)

  • [Publications] Hajime Kitakami, Mitsuko Nishimoto: "Constraint Satisfaction for Reconciling Heterogeneous Tree Databases"Lecture Notes in Computer Science (DEXA2000), Springer-Verlag. 1873. 624-633 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Fujii Ren, Yoichi Takehara: "Tool MKSFF for Acquiring Super-Function in JAVA"International Conference on System, Man, and Cybernetics, IEEE Computer Society Press. 2473-2480 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Hajime Kitakami, Haru Maruyama, Yasuma Mori: "A Web-based System to Support a Part of Visual Reconciliation Work"Proceedings of the International Conference on Artifical Intelligence (IC-AI'2001), CSREA Press. 210-215 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Hajime Kitakami, Tomoki Kanbara, Yasuma Mori, et al.: "Modified PrefixSpan Method for Motif Discovery in Sequence Databases"Lecuture Notes in Artifical Intelligence (PRICAI2002), Springer-Verlag. 2417. 482-491 (2002)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Hajime Kitakami, Yasuma Mori: "Reducing Crossovers in Reconciliation Graphs Using the Coupling Cluster Exchange Method with a Genetic Algorithm"Frontiers in Artificial Intelligence and Applications. 79. 163-174 (2002)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] 周藤俊英, 田村慶一, 森康真, 北上 始: "配列データに対する頻出パターンの並列抽出方式"第14回データ工学ワークショップ(DEWS2003),電子情報通信学会データ工学研究専門委員会,Online Proceedings. 7 (2003)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Hajime Kitakami and Yasuma Mori: "Reducing Crossovers in Reconciliation Graphs Using the Coupling Cluster Exchange Method with a Genetic Algorithm"Frontiers in Artificial Intelligence and Applications. 79. 163-174 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Hajime Kitakami and Mitsuko Nishimoto: "Constraint Satisfaction for Reconciling Heterogeneous Tree Databases"Lecture Notes in Computer Science (DEXA2000), Springer-Verlag, 1873. 624-633 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Fuji Ren and Yoichi Takehara: "Tool MKSFF for Acquiring Super-Function in JAVA"International Conference on System, Man, and Cybernetics, IEEE Computer Society Press. 2473-2480 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Hajime Kitakami, Haru Maruyama and Yasuma Mori: "A Web-based System to Support a Part of Visual Reconciliation Work"Proceedings of the International Conference on Artificial Intelligence (IC-AI'2001), CSREA Press. 210-215 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Hajime Kitakami, Tomoki Kanbara, Yasuma Mori, et al.: "Modified PrefixSpan Method for Motif Discovery in Sequence Databases"Lecture Notes in Computer Science (PRICAI2002), Springer-Verlag, 2417. 482-491 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Toshihide Sutou, Keiichi Tamura, Yasuma Mori, and Hajime Kitakami: Online Proceedings of DEWS2003. 7 (2003)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Hajime Kitakami, Yasuma Mori: "Reducing Crossovers in Reconciliation Graphs Using the Coupling Cluster Exchange Method with a Genetic Algorithm"Frontiers in Artificial Intelligence and Applications, IOS Press. Vol.79. 163-174 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] Hajime Kitakami, Tomoki Kanbara, Yasuma Mori, Susumu Kuroki et al.: "Modified Prefix Span Method for Motif Discovery in Sequence Databases"Lecture Notes in Artificial Intelligence, Springer-Verlag. Vol.2417. 482-491 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] 周藤俊秀, 田村慶一, 森康真, 北上始: "配列データに対する頻出パターンの並列抽出方式"第14回データ工学ワ-クショップ(DEWS2O03), 電子情報通信学会データ工学研究専門委員会,Online Proceedings. 7 (2003)

    • Related Report
      2002 Annual Research Report
  • [Publications] 井上俊治, 北上始, 森康真, 田村慶一, 黒木進: "異種分散データベースの統合支援システム"第4回IEEE広島学生シンポジウム. 235-238 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] Hajime Kitakami, Haru Maruyama, Yasuma Mori: "A Web-based System to Support a Part of Visual Reconciliation Work"Proceedings of the International Conference on Artificial Intelligence (IC-AI'2001), CSREA Press. Vol.1. 210-215 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] 北上 始, 森 康真: "クラスタ交換法と遺伝的アルゴリズムによる調停グラフの交差数減少"人工知能基礎論研究会および知識ベースシステム研究会(合同研究会),人工知能学会資料. 229-236 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] 蒲原朋樹, 森康真, 北上始, 黒木進: "PrefixSpan法を用いたモチーフ発見システム"第13回データ工学ワークショップ(DEWS2002),電子情報通信学会データ工学研究専門委員会 CD-ROM. (出版予定). (2002)

    • Related Report
      2001 Annual Research Report
  • [Publications] Hajime Kitakami,and Mitsuko Nishimoto,CSREA Press: "A Constraint Solver for Reconciling Heterogeneous Trees"Proceedings of The Internatioanl Conference on Artificial Intelligence (IC-AI'2000). Vol.III. 1419-1425 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Hajime Kitakami,and Mitsuko Nishimoto: "Constraint Satisfaction for Reconciling Heterogeneous Tree Databases"Lecture Notes in Computer Science, Proceedings of 11^<th> International Conference (DEXA2000), Springer-Verlag. Vol.1873. 624-633 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Fuji Ren,and Yoichi Takehara: "Tool MKSFF for Acquiring Super-Function in JAVA"2000 IEEE Internatioanl Conference on System, Man, and Cybernetics, IEEE Computer Society . 2473-2480 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Akira Sato,Jun Ogawa,and Hajime Kitakami: "An Impression-based Retrieval System of Music Collection"4^<th> Internatioanl Conference on Knowledge-Based Intelligent Engineering Systems & Allied Technologies, IEEE Computer Society. 856-859 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Hajime Kitakami,Sueda Takashi,Yasuma Mori,and Susumu Kuroki: "Development of a Web System to Support Computer Exercises and its Operation"Proceedings of the 8^<th> Internatioanl Conference on Computers in Education/ICCAI 2000. Vol.1. 509-513 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] 笠英昭,北上始,森康真,黒木進: "トライ構造による相関ルール計算法を授業アンケートデータへ適用した結果"第2回データマイニングワークショップ,日本ソフトウェア科学会. (発表予定(3月27日)). (2001)

    • Related Report
      2000 Annual Research Report

URL: 

Published: 2000-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi