Verification and Identification Approach to Maintain MVCC in Cloud Computing

2017 ◽  
Vol 7 (4) ◽  
pp. 41-59 ◽  
Author(s):  
Niharika Singh ◽  
Upasana Lakhina ◽  
Ajay Jangra ◽  
Priyanka Jangra
Keyword(s):  
Concurrency Control ◽  
Database Systems ◽  
Data File ◽  
Data Consistency ◽  
Service Environment ◽  
Shared Data ◽  
Efficient Access ◽  
Multiple Processes ◽  
Identification Approach ◽  
Set Up

MultiVersion concurrency control is maintained over transactional database systems for secure, fast and efficient access to the shared data file implementation scenario. Most of the services and application offered in cloud world are real-time, which entails optimized compatibility service environment between master and slave clusters. In the paper, offered methodology supports replication and triggering methods intended for data consistency and dynamicity. Here, cluster based communication is set up for processing. Intercommunication among different clusters is administered through middleware besides slave intra-communication is handled by verification and identification protection. The proposed approach incorporates resistive flow to handle high impact systems that identifies and verifies multiple processes. Statistical analysis determines that the new scheme reduces the overheads from different master and slave servers as they are co-located in clusters which allow increased horizontal and vertical scalability of resources.

scholarly journals Toward a Faster Fault Tolerant Consensus to Maintain Data Consistency in Collaborative Environments

2017 ◽  
Vol 26 (03) ◽  
pp. 1750002
Author(s):  
Fouad Hanna ◽  
Lionel Droz-Bartholet ◽  
Jean-Christophe Lapayre
Keyword(s):  
Network Model ◽  
Fault Tolerant ◽  
Data Consistency ◽  
Consensus Algorithm ◽  
Simulation Platform ◽  
Consensus Problem ◽  
Collaborative Environments ◽  
Consensus Algorithms ◽  
Shared Data ◽  
Simultaneous Process

The consensus problem has become a key issue in the field of collaborative telemedicine systems because of the need to guarantee the consistency of shared data. In this paper, we focus on the performance of consensus algorithms. First, we studied, in the literature, the most well-known algorithms in the domain. Experiments on these algorithms allowed us to propose a new algorithm that enhances the performance of consensus in different situations. During 2014, we presented our very first initial thoughts to enhance the performance of the consensus algorithms, but the proposed solution gave very moderate results. The goal of this paper is to present a new enhanced consensus algorithm, named Fouad, Lionel and J.-Christophe (FLC). This new algorithm was built on the architecture of the Mostefaoui-Raynal (MR) consensus algorithm and integrates new features and some known techniques in order to enhance the performance of consensus in situations where process crashes are present in the system. The results from our experiments running on the simulation platform Neko show that the FLC algorithm gives the best performance when using a multicast network model on different scenarios: in the first scenario, where there are no process crashes nor wrong suspicion, and even in the second one, where multiple simultaneous process crashes take place in the system.

scholarly journals Concurrency Control in Database Systems

2019 ◽  
Vol 1 (2) ◽  
pp. 26-40
Author(s):  
Dardina Tasmere ◽  
Md. Nazmus Salehin
Keyword(s):  
Concurrency Control ◽  
Phase Locking ◽  
Wait Time ◽  
Arrival Rate ◽  
Database Systems ◽  
Control Algorithms ◽  
Control Mechanisms ◽  
Time Stamp ◽  
System Behavior ◽  
Two Phase

Concurrency control mechanisms including the wait, time-stamp and rollback mechanisms have been briefly discussed. The concepts of validation in optimistic approach are summarized in a detailed view. Various algorithms have been discussed regarding the degree of concurrency and classes of serializability. Practical questions relating arrival rate of transactions have been presented. Performance evaluation of concurrency control algorithms including degree of concurrency and system behavior have been briefly conceptualized. At last, ideas like multidimensional timestamps, relaxation of two-phase locking, system defined prewrites, flexible transactions and adaptability for increasing concurrency have been summarized.

Concurrency control in mobile distributed real-time database systems

2000 ◽  
Vol 25 (4) ◽  
pp. 261-286 ◽  
Author(s):  
Kam-Yiu Lam ◽  
Tei-Wei Kuo ◽  
Wai-Hung Tsang ◽  
Gary C.K Law
Keyword(s):  
Real Time ◽  
Concurrency Control ◽  
Database Systems ◽  
Real Time Database

Object-Relational Spatial Indexing

2011 ◽  
pp. 49-80
Author(s):  
Hans-Peter Kriegel ◽  
Martin Pfeifle ◽  
Marco Potke ◽  
Thomas Seidl ◽  
Jost Enderle
Keyword(s):  
Spatial Data ◽  
Concurrency Control ◽  
Buffer Management ◽  
Database Systems ◽  
Data Types ◽  
Spatial Access ◽  
Access Methods ◽  
Object Relational ◽  
Relational Database Systems ◽  
Spatial Access Methods

In order to generate efficient execution plans for queries comprising spatial data types and predicates, the database system has to be equipped with appropriate index structures, query processing methods and optimization rules. Although available extensible indexing frameworks provide a gateway for seamless integration of spatial access methods into the standard process of query optimization and execution, they do not facilitate the actual implementation of the spatial access method. An internal enhancement of the database kernel is usually not an option for database developers. The embedding of a custom, block-oriented index structure into concurrency control, recovery services and buffer management would cause extensive implementation efforts and maintenance cost, at the risk of weakening the reliability of the entire system. The server stability can be preserved by delegating index operations to an external process, but this approach induces severe performance bottlenecks due to context switches and inter-process communication. Therefore, we present the paradigm of object-relational spatial access methods that perfectly fits to the common relational data model, and is highly compatible with the extensible indexing frameworks of existing object-relational database systems, allowing the user to define application-specific access methods.

Sign in / Sign up

Export Citation Format

Share Document