|
|
|
A Lock Method for KBMSs Using Abstraction Relationships' Semantics
Fernando de Ferreira Rezende
Theo Härder
Department of Computer Science
University of Kaiserslautern
P.O.Box 3049, 67653 Kaiserslautern, Germany
Phone: +49 (0631) 205 3274|4031 - Fax +49 (0631) 205 3558
e-mail: {rezende|haerder}@informatik.uni-kl.de
Full paper (postscript version, compressed by gzip)
Abstract
Knowledge Base Management Systems (KBMSs) are a growing research area finding
applicability in different domains. As a consequence, the demand for
ever-larger knowledge bases (KBs) is growing more and more. Inside this context,
knowledge sharing turns out to be a crucial point to be supported by KBMSs.
In this paper, we propose a way of controlling knowledge sharing. We show how
we obtain serializability of transactions providing many different locking
granules, which are based on the semantics of the abstraction relationships.
The main benefit of our technique is the high degree of potential concurrency,
to be obtained through a logical partitioning of the KB graph and the provision
of lock types used for each referenced partition. By this way, we capture more
of the semantics contained in a KB graph, through an interpretation of its
edges grounded in the abstraction relationships, and make feasible a full
exploitation of all inherent parallelism in a knowledge representation approach.
Published in: Proc. 3rd Int. Conf. on Information and Knowledge Management
(CIKM'94), Gaithersburg, MD, Nov. 1994, pp. 112-121.
|
