An Efficient Storage Manager
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.
KeywordsLogic Programming Storage Manager Disk Access Path Identity Language Interface
Unable to display preview. Download preview PDF.
- 1.Cruickshank, G.: Persistent Storage Interface for Prolog-TERMdb, System Documentation. Draft Revision: 1.5, Cray Systems (1994)Google Scholar
- 3.ECL’PS” 3.7: Knowledge Base User Manual. ECRC GmbH (1998)Google Scholar
- 5.Freeston, M.: The BANG file: a new kind of grid file. Proc. of ACM, SIGMOD Conf. (1987) 260–269Google Scholar
- 9.Nilsson, H., Ellemtel, A.: The External Storage Facility in SICStus Prolog. R:91:13, Swedish Institute of Computer Science (1995)Google Scholar
- 11.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–250Google Scholar
- 12.Sagonas, K., Swift, T., Warren, D.S.: XSB as an Efficient Deductive Database Engine. Proc. of ACM SIGMOD Conf. (1994) 442–453Google Scholar