Retrieval-By-Unification Operation on a Relational Knowledge Base.

Yukihiro Morita, Haruo Yokota, Kenji Nishida, Hidenori Itoh: Retrieval-By-Unification Operation on a Relational Knowledge Base. VLDB 1986: 52-59

@inproceedings{DBLP:conf/vldb/MoritaYNI86,
  author    = {Yukihiro Morita and
               Haruo Yokota and
               Kenji Nishida and
               Hidenori Itoh},
  editor    = {Wesley W. Chu and
               Georges Gardarin and
               Setsuo Ohsuga and
               Yahiko Kambayashi},
  title     = {Retrieval-By-Unification Operation on a Relational Knowledge
               Base},
  booktitle = {VLDB'86 Twelfth International Conference on Very Large Data Bases,
               August 25-28, 1986, Kyoto, Japan, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1986},
  isbn      = {0-934613-18-4},
  pages     = {52-59},
  ee        = {db/conf/vldb/MoritaYNI86.html},
  crossref  = {DBLP:conf/vldb/86},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

This paper describes a method for retrieval-by-unification (RBU) operations, especially unification-join, on a relational knowledge base. The relational knowledge base is a conceptual model for a knowledge base. In this model knowledge is represented by term relations. Terms in the term relations are retrieved with operation called RBUs (i.e., unification-join and unification-restriction). To perform unification-join in the simplest manner, all possible pairs of tuples in term relations should be checked to see if each pair of terms in the tuples is unifiable or not. This would result in an extremely heavy processing load. We propose a method which involves ordering terms and, as result, omitting some pairs from this processing. The paper also describes a method for implementing the unificaiion engine (UE), that is, hardware dedicated to the RBU operations.

Copyright © 1986 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb7588 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Wesley W. Chu, Georges Gardarin, Setsuo Ohsuga, Yahiko Kambayashi (Eds.): VLDB'86 Twelfth International Conference on Very Large Data Bases, August 25-28, 1986, Kyoto, Japan, Proceedings. Morgan Kaufmann 1986, ISBN 0-934613-18-4
Contents

References

[Kakuta 85]: ...
[King 80]: W. Frank King III: Relational Database Systems: Where We Stand Today. IFIP Congress 1980: 369-381
[Knuth 73a]: Donald E. Knuth: The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition. Addison-Wesley 1973
[Knuth 73b]: Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
[Merrett 83]: T. H. Merrett: Why Sort-Merge Gives the Best Implementation of the Natural Join. SIGMOD Record 13(2): 39-51(1983)
[Monoi 86]: ...
[Murakami 85]: ...
[Robinson 65]: John Alan Robinson: A Machine-Oriented Logic Based on the Resolution Principle. J. ACM 12(1): 23-41(1965)
[Sakai 84]: Hiroshi Sakai, Kazuhide Iwata, Shigeo Kamiya, Masaaki Abe, Akio Tanaka, Shigeki Shibayama, Kunio Murakami: Design and Implementation of the Relational Datbase Engine. FGCS 1984: 419-426
[Tanaka 84]: Yuzuru Tanaka: A Multiport Page-Memory Architecture and A Multiport Disk-Cache System. New Generation Comput. 2(3): 242-260(1984)
[Tanaka 85]: Yuzuru Tanaka: A VLSI Algorithm for Sorting Variable-Length Character Strings. New Generation Comput. 3(3): 307-328(1985)
[Todd 77]: ...
[Yasuura 84]: Hiroto Yasuura: On Parallel Computational Complexity of Unification. FGCS 1984: 235-243
[Yasuura 85]: ...
[Yokota 86]: ...