Abstract
When dealing with large quantities of clauses, the use of persistent knowledge is inevitable, and indexing methods are essential to answer queries efficiently. We introduce PerKMan, a storage manager that uses G-trees and aims at efficient manipulation of large amount of persistent knowledge. PerKMan may be connected to Prolog systems that offer an external C language interface. As well as the fact that the storage manager allows different arguments of a predicate to share a common index dimension in a novel manner, it indexes rules and facts in the same manner. PerKMan handles compound terms efficiently and its data structures adapt their shape to large dynamic volumes of clauses, no matter what their distribution. The storage manager achieves fast clause retrieval and reasonable use of disk space.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cruickshank, G.: Persistent Storage Interface for Prolog-TERMdb, System Documentation. Draft Revision: 1.5, Cray Systems (1994)
Derr, M.A., Morishita, S., Phipps, G.: The Glue-Nail Deductive Database System: Design, Implementation, and Evaluation. The VLDB Journal, vol. 3, no. 2 (1994) 123–160
ECL’PS” 3.7: Knowledge Base User Manual. ECRC GmbH (1998)
Van Emde Boas, G., Van Emde Boas, P.: Storing and evaluating Horn-clause rules in a relational database. IBM J Res.Develop. vol. 30, no. 1 (1986) 80–92
Freeston, M.: The BANG file: a new kind of grid file. Proc. of ACM, SIGMOD Conf. (1987) 260–269
Ioannidis, Y.E., Tsangaris, M.: The Design, Implementation, and Performance Evaluation of BERMUDA. IEEE Trans, on Knowledge and Data Eng., vol. 6, no. 1 (1994) 38–56
Kapopoulos D.G., Hatzopoulos, M.: The Gr_Tree: The Use of Active Regions in G-Trees. In: J. Eder, I. Rozman and T. Welzer (eds.): Advances in Databases and Information Systems. Lecture Notes in Computer Science, vol. 1691. Springer-Verlag, (1999) 141–155
Kumar, A.: G-Tree: A New Data Structure for Organizing Multidimensional Data. IEEE, Trans, on Knowledge and Data Eng., vol. 6, no. 2 (1994) 341–347
Nilsson, H., Ellemtel, A.: The External Storage Facility in SICStus Prolog. R:91:13, Swedish Institute of Computer Science (1995)
Ramakrishnan, R., Srivastava, D., Sudarshan, S., Seshadri, P.: The CORAL Deductive System. The VLDB Journal, vol. 3, no. 2 (1994) 161–210
Ramamohanarao, K., Shepherd, J., Balbin, I., Port, G., Naish, L., Thorn, J., Zobel, J., Dart, P.: The NU-Prolog deductive database system. In: Gray, P.M.D., Lucas, R.J. (eds.): Prolog and Databases. West Sussex, Ellis Horwood limited (1988) 212–250
Sagonas, K., Swift, T., Warren, D.S.: XSB as an Efficient Deductive Database Engine. Proc. of ACM SIGMOD Conf. (1994) 442–453
Vaghani, J., Ramamohanarao, K., Kemp, D.B., Somogyi, Z., Stuckey, P.J., Leask T.S., Harland, J.: The Aditi Deductive Database System. The VLDB Journal, vol. 3, no. 2 (1994) 245–288
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapopoulos, D.G., Hatzopoulos, M., Stamatopoulos, P. (2000). An Efficient Storage Manager. In: Štuller, J., Pokorný, J., Thalheim, B., Masunaga, Y. (eds) Current Issues in Databases and Information Systems. ADBIS DASFAA 2000 2000. Lecture Notes in Computer Science, vol 1884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44472-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-44472-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67977-6
Online ISBN: 978-3-540-44472-5
eBook Packages: Springer Book Archive