High concurrency for continuously evolving OODBMS

  • Authors:

  • V. Geetha;N. Sreenath

  • Affiliations:

  • Dept. of Information Technology, Pondicherry Engineering College, Puducherry, India;Dept. of Computer Science & Engg, Pondicherry Engineering College, Puducherry, India

  • Venue:
  • ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

OODBMS is widely favored for mapping domains like CAD, with complex representation requirements. The transactions accessing OODBMS can be categorized into runtime transactions and design time transactions. Runtime transactions are meant for accessing data and design time transactions are meant for accessing schema. Parallel execution of transactions is supported to promote concurrency and throughput. In continuously evolving business domains, frequent schema changes are done to reflect the changes of business domain. Then it implies that more number of design time transactions arrive parallely with runtime transactions. Concurrency control schemes are employed to maintain the consistency of the database. Several semantic multi-granular lock based concurrency control schemes have been proposed in the literature. They have the drawback of either poor performance or high maintenance overhead when applied to continuously evolving domains. This paper proposes semantic lock-based concurrency control mechanism with better performance and nil maintenance overhead for continuously evolving OODBMS. It uses lock rippling to improve the performance.