Models and Technologies for Advanced Information Bases

高级信息库的模型和技术

• 批准号: 08244105
• 负责人: MAKINOUCHI Akifumi
• 金额: $ 121.86万
• 依托单位: Kyushu University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research on Priority Areas
• 财政年份: 1996
• 资助国家: 日本
• 起止时间: 1996 至 1998
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-08244105/
• 关键词: Spatial Database; Logical Data Analysis; Parallel Data Mining; Object Databases; Database Consistency; Data Programming Language; Combinatrial Optimization; Cell Complex; 情報ベース; データベース; 情報ベースモデル; データベースモデル; アルゴリズム; データ構造; 並列処理; データマイニング; ト

The project aims at the research on basic technologies for developing future information bases. As the result our research covers various aspects of databases from spatial database model to applications of theoritical computer science to data engineering. The followings are some examples.(a) A spatial data modeling method based on 'cell complex' which comes from the topology theory was proposed. This allows retrieval of spatial data using topological operations as well as analitical geometry ones.(b) A method to assure the correctness of the parts of an object database management system such as views, programs, and so on was intriduced. This is based on the set-theoritical specification of these parts.(c) The combinatorial theory was applied to database qury evaluation. Opimization based on the theory was successfully performed when it is applied to relatively-small databases.(d) Theory of Boolean algebra was used tu analyse data in databases. It allows to mine useful facts hidden in the databases.(e) A data programming language was proposed and designed for database applications. The languge unifies database and programming languge.(f) A new method for parallel data mining was presented. It shows a good performance for association rule mining.

该项目旨在研究发展未来信息库的基础技术。因此，我们的研究涵盖了数据库的各个方面，从空间数据库模型到理论计算机科学在数据工程中的应用。提出了一种基于拓扑学理论的“单元复合体”空间数据建模方法。它允许使用拓扑操作和分析几何操作来检索空间数据。(B)介绍了一种确保对象数据库管理系统的部分如视图、程序等的正确性的方法。这是基于这些部分的集合论规范。(C)将组合理论应用于数据库查询评价。将该理论应用于较小的数据库，成功地实现了基于该理论的优化。(D)利用布尔代数理论分析数据库中的数据。它允许挖掘隐藏在数据库中的有用事实。(E)提出并设计了一种用于数据库应用的数据编程语言。该语言将数据库和程序设计语言相结合。(F)提出了一种新的并行数据挖掘方法。该算法在关联规则挖掘中表现出较好的性能。

项目成果

M.Kitsuregawa: "Parallel Data Mining on a Commodity PC Cluster Connected with an ATM Switch"Proc. IPSJ International Symposium on Information Systems and Technologies for Network Society. 332-339 (1997)

M.Kitsurekawa：“与 ATM 交换机连接的商品 PC 集群上的并行数据挖掘”Proc。

H.Ibaraki: "Data analysis by Pocision Trees"IEICE Transactions on Information and Systems. E82-D. 76-88 (1999)

H.Ibaraki：“Pocision Trees 的数据分析”IEICE Transactions on Information and Systems。

K. Iwama: "Undecidability on Quntum Finite Automata"Proc. STOC99. 368-375 (1999)

K. Iwama：“量子有限自动机的不可判定性”Proc。

Otsuki,M.,Segawa,J.,Yoshida,N.,Makinouchi,A.: "Visual Aids for Cataloging and Code Generation for SGML-based Documents of Design Patterns" Srd World Conf.on Integrated Design and Process Technology. 305-312 (1998)

Otsuki,M.、Sekawa,J.、Yoshida,N.、Makinouchi,A.：“用于基于 SGML 的设计模式文档编目和代码生成的可视化辅助工具”Srd World Conf.on 集成设计和处理技术。

K.Makino,T.Suda,H.Ono, and T.Ibaraki: "Data Analysis by Positive Decision Trees" IEICE Transcations on Information and Systems. Vol.E82-D. 76-88 (1999)

K.Makino、T.Suda、H.Ono 和 T.Ibaraki：“积极决策树的数据分析”IEICE 信息和系统交易。