Storing and evaluating Horn-clause rules in a relational database
IBM Journal of Research and Development
The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
The NU-Prolog deductive database system
Prolog and databases: implementations and new directions
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The glue-nail deductive database system: design, implementation, and evaluation
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
The aditi deductive database system
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
The Design, Implementation, and Performance Evaluation of BERMUDA
IEEE Transactions on Knowledge and Data Engineering
G-Tree: A New Data Structure for Organizing Multidimensional Data
IEEE Transactions on Knowledge and Data Engineering
The Gr_Tree: The Use of Active Regions in G-Trees
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
The External Storage Facility in SICStus Prolog
The External Storage Facility in SICStus Prolog
| Hi-index | 0.00 |
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.