Abstract
This paper describes a database indexing scheme, based on the method of superimposed codewords, which is suitable for dealing with very large databases of Prolog clauses. Superimposed codeword schemes provide a very efficient method of retrieving records from large databases in only a small number of disk accesses. The scheme described in this paper extends the standard techniques of superimposed coding to handle general Prolog terms, including functors and variables, thus making it simple to store Prolog rules in the database.
This work was performed as part of the Machine Intelligence Project at the University of Melbourne. It was supported by the Commonwealth Department of Science and Pyramid Technology, Australia.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
I. Futo, F. Darvas and P. Szeredi, “The application of Prolog to the development of QA and DBM systems”, in Logic and Data Bases, H. Gallaire and J. Minker (editor), Plenum Press, New York, 1978, 347–376.
L. Naish, “MU-Prolog 3.2 Reference Manual”, Technical Report 85/11, Department of Computer Science, University of Melbourne, November 1985.
K. Ramamohanarao, J. W. Lloyd and J. A. Thom, “Partial-match Retrieval using Hashing and Descriptors”, Technical Report 82/1, Department of Computer Science, University of Melbourne, February 1982.
K. Ramamohanarao,, J. W. Lloyd and J. A. Thom, “Partial-match Retrieval using Hashing and Descriptors”, ACM Transactions on Database Systems 8, 4 (December 1983), 552–576.
K. Ramamohanarao and J. Shepherd, “A superimposed codeword indexing scheme for very large Prolog databases”, Technical Report 85/17, Department of Computer Science, University of Melbourne, November 1985.
C. S. Roberts, “Partial match retrieval via the method of superimposed codes”, Proceedings of the IEEE 67, 2 (1979), 522–528.
R. Sacks-Davis and K. Ramamohanarao, “A two level superimposed coding scheme for partial match retrieval”, Information Systems 8, 4 (1983), 273–280. Originally appeared as Technical Report 82/2, Department of Computer Science, University of Melbourne, 1982.
J. Samanek, “Partial-match retrieval using multi-level superimposed codes”, M.Sc. Thesis, University of New South Wales, April 1982.
M. J. Wise and D. M. W. Powers, “Indexing Prolog clauses via superimposed codewords and field encoded words”, Proceedings of the IEEE Conference on Logic Programming, Atlantic City, NJ, January 1984, 203–210.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramamohanarao, K., Shepherd, J. (1986). A superimposed codeword indexing scheme for very large Prolog databases. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_105
Download citation
DOI: https://doi.org/10.1007/3-540-16492-8_105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16492-0
Online ISBN: 978-3-540-39831-8
eBook Packages: Springer Book Archive