Locking for Concurrent Transactions on Ontologies
published: July 8, 2013, recorded: May 2013, views: 50
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Collaborative editing on large-scale ontologies imposes serious demands on concurrent modifications and con ict resolution. In order to enable robust handling of concurrent modications, we propose a locking-based approach that ensures independent transactions to simultaneously work on an ontology while blocking those transactions that might in uence other transactions. In the logical context of ontologies, dependence and independence of transactions do not only rely on the single data items that are modified, but also on the inferences drawn from these items. In order to address this issue, we utilize logical modularization of ontologies and lock the parts of the ontology that share inferential dependencies for an ongoing transaction. We compare and evaluate modularization and the naive approach of locking the whole ontology for each transaction and analyze the trade-o between the time needed for computing locks and the time gained by running transactions concurrently.
Download slides: eswc2013_scheglmann_concurrent_transactions_01.pdf (6.0 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !