Exploiting abstraction relationships' semantics for transaction synchronization in KBMSs

摘要

Currently, knowledge sharing is turning out to be a crucial area that needs to be supported by Knowledge Base Management Systems (KBMSs). We propose an approach for transaction synchronization in KBMSs-LARS (Locks using Abstraction Relationships' Semantics). We show how we obtain serializability of transactions thereby providing different locking granules. The main benefit of our technique is the high degree of potential concurrency, which is obtained by means of a logical partitioning of the knowledge base (KB) grounded in the abstraction relationships, and the provision of many lock types to be used on the basis of each partition. In this way, we capture the abstraction relationships' semantics which are contained in a KB graph for transaction synchronization purposes and enable the exploitation of the inherent parallelism in a knowledge representation approach.