Abstract
The SICStus External Database implements an efficient way of storing general Prolog terms (possibly with variables) on disk. They can be retrieved with indexing on user specified parts of the terms. The indexing is a constant-time operation, and the total fetch time is slightly better than a linear function of the size. The algorithm is an improved version of superimposed codewords. Dynamic hashing is used for storage. Some performance data is given.
Work performed at the Swedish Institute of Computer Science (SICS).
This is a preview of subscription content, log in via an institution to check access.
References
Mats Carlsson et al. Industrial SICStus Prolog User's Manual. Swedish Institute of Computer Science, 1990.
Department of Computer Science, University of Melbourne. NU-Prolog, Reference Manual, May 1987.
R. J. Enbody and H.C. Du. Dynamic hashing schemes. ACM Computing Surveys, 20(2), June 1988.
Hans Nilsson. The external storage facility in SICStus Prolog. Technical Report SICS R91:13 ISRN SICS-R-91/13-SE, Swedish Institute of Computer Science, October 1991.
Kotagiri Ramamohanarao and John Shepard. A superimposed codeword indexing scheme for very large prolog databases. In Proceedings of the third International Conference of Logic Programming, July 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nilsson, H. (1992). The external database in SICStus Prolog. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013098
Download citation
DOI: https://doi.org/10.1007/BFb0013098
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55727-2
Online ISBN: 978-3-540-47279-7
eBook Packages: Springer Book Archive