Efficient Algorithms and Performance Results for Multi-User Knowledge Bases
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Knowledge Base Technology. Pages 759-766.
Abstract
The paper describes research efforts to develop efficient implementation techniques for large, shared knowledge bases, focusing on efficient concurrent access of large knowledge bases by multiple users. We present an algorithm , called the Dynamic Directed Graph policy, originally proposed in [Chaudhri et al., 1992], which allows efficient interleaved execution of transactions against a large knowledge base with the intent of optimizing transaction throughput. The implementation of the policy and experimental evaluation results are also presented and discussed . The paper concludes with discussion on lessons learnt from this research.
@inproceedings{ijcai1995p99,
title = {Efficient Algorithms and Performance Results for Multi-User Knowledge Bases},
author = {Chaudhri, Vinay K. and Mylopoulos, John},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {759--766},
year = {1995},
note = {Knowledge Base Technology},
url = {https://ijcai.org/proceedings/1995/99},
}
TY - CPAPER TI - Efficient Algorithms and Performance Results for Multi-User Knowledge Bases AU - Chaudhri, Vinay K. AU - Mylopoulos, John T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 759 EP - 766 UR - https://ijcai.org/proceedings/1995/99 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
