Efficient algorithms and performance results for multi-user knowledge bases

  • Authors:
  • Vinay K. Chaudhri;John Mylopoulos

  • Affiliations:
  • Department of Computer Science, University of Toronto, Toronto, Ontario;Department of Computer Science, University of Toronto, Toronto, Ontario

  • Venue:
  • IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

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.