Storage management for objects in EXODUS
Object-oriented concepts, databases, and applications
A storage system for scalable knowledge representation
CIKM '94 Proceedings of the third international conference on Information and knowledge management
A Persistent Store for Large Shared Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Modeling a vocabulary in an object-oriented database
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
FramerD: representing knowledge in the large
IBM Systems Journal
A Collaborative Environment for Authoring Large Knowledge Bases
Journal of Intelligent Information Systems
A Survey of Methods for Scaling Up Inductive Algorithms
Data Mining and Knowledge Discovery
Edward A. Feigenbaum and Julian Feldman, eds., Computers and Thought
Minds and Machines
Controlled Vocabularies in OODBs: Modeling Issues and Implementation
Distributed and Parallel Databases
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Efficient management of very large ontologies
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A generic knowledge-base browser and editor
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
| Hi-index | 0.00 |
Frame knowledge representation systems lack two important capabilities that prevent them from scaling up to large applications: they do not support fast access to large knowledge bases (KBs), nor do they provide concurrent multiuser access to shared KBs. We describe the design and implementation of a storage subsystem that submerges a database management system (DBMS) within a knowledge representation system. The storage subsystem incrementally loads referenced frames from the DBMS, and can save to the DBMS only those frames that have been updated in a given session. We present experimental results that show our approach to be an improvement over the use of flat files, and that evaluate several variations of our approach.