Advertisement

Implementation of Inferential Relational Database System

  • Toshihisa Takagi
  • Fumihiro Matsuo
  • Shooichi Futamura
  • Kazuo Ushijima

Abstract

Tsuno has been developed to retrieve the relational database created by Adbis which was developed for supporting the construction of scientific database systems at the Computer Center, Kyushu University. Tsuno is an interactive retrieval system having the inference facilities based on Horn set refutation procedures and is now used as the query system for two databases. This paper describes the implementation of Tsuno.

Keywords

Predicate Symbol Horn Clause Compound Name Empty Clause Clausal Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    F. Matsuo, S. Futamura, and T. Takagi, Adbis -An Inferential Relational Database Management System, Trans. Inform. Process. Soc. of Japan, 24, 2, 249–255 (1983)(in Japanese).Google Scholar
  2. 2.
    J. Minker, Search Strategy and Selection Function for an Inferential Relational System, ACM Trans. Database Syst., 3, 1, 1–31 (1978).CrossRefGoogle Scholar
  3. 3.
    L. Henshen, and L. Wos, Unit Refutations and Horn Sets, J.ACM, 21, 4, 590–605 (1974).CrossRefGoogle Scholar
  4. 4.
    W. F. Clocksin, and C. S. Mellish, “Programming in Prolog,” Springer-Verlag, Berlin Heidelberg (1981).MATHGoogle Scholar
  5. 5.
    R. Kowalski, Predicate Logic as Programming Language, Information Processing 74, North-Holland, Amsterdam, 569–574 (1974).Google Scholar
  6. 6.
    G. Gentzen, Untersuchungen über das Logische Schliessen, Math. Z., 39, 176–210, 405–431 (1935).MathSciNetCrossRefGoogle Scholar
  7. 7.
    D. W. Loveland, “Automated Theorem Proving: A Logical Basis,” North-Holland, Amsterdam (1978).MATHGoogle Scholar
  8. 8.
    G. Salton, and M.McGill, “Introduction to Modern Information Retrieval,” Mcgraw-Hill, New York (1983).MATHGoogle Scholar
  9. 9.
    F. H. Allen, S. Bellard, M. D. Brice, B. A. Cartwright,, A. Doubleday, H. Higgs, T. Hummelink, B. G. Hummelink-Peters, O. Kennard, W. S. Motherwell, J. R. Rodgers, and D. G. Watson, The Cambridge Crystallographic Data Center: Computer-Based Search, Retrieval, Analysis and Display of Information, Acta Cryst., B-35, 10, 2331–2339 (1979).Google Scholar
  10. 10.
    F. Matsuo, and T.Takagi, A Horn Set Refuter for Database Manipulation, Trans. Inform. Process. Soc. of Japan, 25, 3, 458–464 (1984) (in Japanese).Google Scholar
  11. 11.
    F.Matsuo, Number Theoretic Functions Calculated by Deterministic Refutation of Horn Sets, ibid., 25, 3, 1984, 437–442 (in Japanese).MathSciNetGoogle Scholar
  12. 12.
    K. L. Clark, Negation as Failure, in “Logic and Data Bases,” H. Gallaire and J. Minker, ed., Plenum, New York (1978).Google Scholar
  13. 13.
    D. Comer, The Ubiquitous B-tree, Comput. Surv., 11,2, 121–137 (1979).CrossRefMATHGoogle Scholar
  14. 14.
    S. Kuhara, F. Matsuo, S. Futamura, A. Fujita, T. Shinohara, T. Takagi, and Y. Sakaki, GENAS: a Database System for Nucleic Acid Sequence Analysis, Nucleic Acids Res., 12, 1, 88–89 (1984).CrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1987

Authors and Affiliations

  • Toshihisa Takagi
    • 1
  • Fumihiro Matsuo
    • 2
  • Shooichi Futamura
    • 2
  • Kazuo Ushijima
    • 1
  1. 1.Department of Computer Science and Communication EngineeringKyushu UniversityFukuokaJapan
  2. 2.Computer CenterKyushu UniversityFukuokaJapan

Personalised recommendations