Abstract
An experimental distributed knowledge base system, KBMS PHI, is being developed as a part of the knowledge base research in the Fifth Generation Computer Systems project. A query expressed in Horn clause form is combined with related rules and compiled to relational operations to realize efficient processing in PHI.
A superimposed code scheme is being developed to speed up the processing. This paper describes the superimposed code scheme for compiled relational operations and analyzes its performance. An extension of the scheme for the processing of terms and rules is also discussed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Itoh, H., Research and Development on Knowledge Base Systems at ICOT, Proc. of 12th VLDB, pp.437–445, 1986
Uchida, S. and Yokoi, T., Sequential Inference Machine: SIM, Proc. of FGCS, pp.58–69, Tokyo 1984
Taguchi et al., INI: Internal Network on the ICOT Programming Laboratory and Its Future, ICCC, Sydney, Australia, Oct. 1984
Miyazaki, N., A Data Sublanguage Approach to Interfacing Predicate Logic Languages and Relational Databases, ICOT Technical Memorandum, 1982
Fuchi, K., Aiming for Knowledge Information Processing Systems, Proc. of FGCS, p.2–15 to p.2–28, Tokyo, 1981
Bancilhon, F. and Ramakrishnan R., An Amateur’s Introduction to Recursive Query Processing Strategies, SIGMOD ‘86 Proc., pp.16–52, 1986
Miyazaki, N., Yokota, H. and Itoh, H., Compiling Horn Clause Queries in Deductive Databases: A Horn Clause Transformation Approach, ICOT Technical Report, 1986
Abiru, Y., Haniuda, H., Miyazaki N. and Morita, Y., KBMS PHI: An Experimental Deductive Database System PHI/K2, Proc. 34th Annual Convention IPS Japan, pp.1491–1492, 1987 (in Japanese)
Miyazaki, N. and Itoh, H., Restricted Least Fixed Points and Recursive Query Processing Strategies, ICOT Technical Report,1987
Roberts, CS., Partial-Match Retrieval via Method of Superimposed Codes, Proc. of IEEE, 67(12), pp.1624–1642, 1979
Wada, M., et al., KBMS PHI: Superimposed Codes for Relational Algebra Operations, Proc. 34th Annual Convention IPS Japan, 3K-7, pp.1489–1490, 1987, (in Japanese)
Wise, M. J., and Powers, D. M. W., Indexing PROLOG Clauses via Superimposed Code Words and Field Encoded Words, Proc. IEEE Conf. Logic Programming, Atlantic City, NJ, January 1984, pp.203–210.
Morita, Y., et al., Retrieval-By-Unification Operation on a Relational Knowledge Base, Proc. of the 12th VLDB, 1986
Ramamohanarao, K., and Shepherd J., Answering Queries in Deductive Database Systems, Logic Programming: Proc. Fourth Int’l Conf Vol.2, pp.1014–1033, 1987
Berra, P.B. et al., Computer Architecture for a Surrogate File to a Very Large Data/Knowledge Bases, IEEE COMPUTER, March 1987
Morita, Y., Wada, M. and Itoh, H., Structure Retrieval via the Method of Superimposed Codes., Proc. 33rd Annual Convention IPS Japan, 6L-8, 1986, (in Japanese)
Morita, Y., et al., A Knowledge Base Machine with an MPPM (3) — An Indexing Scheme for Terms -, Proc. 35th Annual Convention IPS Japan, 2C-7, 1987, (in Japanese), (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Kluwer Academic Publishers, Boston
About this chapter
Cite this chapter
Wada, M., Morita, Y., Yamazaki, H., Yamashita, S., Miyazaki, N., Itoh, H. (1988). A Superimposed Code Scheme for Deductive Databases. In: Kitsuregawa, M., Tanaka, H. (eds) Database Machines and Knowledge Base Machines. The Kluwer International Series in Engineering and Computer Science, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1679-4_41
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1679-4_41
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8948-7
Online ISBN: 978-1-4613-1679-4
eBook Packages: Springer Book Archive