Recoverable Timestamping Approach For Concurrency Control In Distributed Database
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 7
Abstract
A distributed database consists of different number of sites which are interconnected by a communication network. In this environment in absence of proper synchronization among different transaction may lead to inconsistency of databases. A new approach for timestamp ordering problem in serializable schedules is presented. Strict 2PL does not allow all possible serializable schedules and so does not result high throughput. The main advantages of the approach are the ability to enforce the execution of transaction to be recoverable and the high achievable performance of concurrent execution in distributed databases.
Authors and Affiliations
Rinki chauhan , Suman Malik , R K Rathy , Preeti Bhati
Keywords
Related Articles
- EP ID EP92109
- DOI -
- Views 138
- Downloads 0
Classification of Herbs Plant Diseases via Hierarchical Dynamic Artificial Neural Network after Image Removal using Kernel Regression Framework
When herbs plants has disease, they can display a range of symptoms such as colored spots, or streaks that can occur on the leaves, stems, and seeds of the plant. These visual symptoms continuously change their color, sh...
Various Schemes to Speed up the PC during Virus Scan
The current threat landscape is changing and we have seen a large volume of new viruses captured by security vendors each day. Customers always complain that anti-virus software slow down their computers by consuming muc...
Debugging, Advanced Debugging and Runtime Analysis
Abstract—This paper discusses debugging and runtime analysis of software and outlines its enormous benefits to software developers and testers. A debugger is usually quite helpful in tracking down many logic problems. H...
Implementation of Distributed Algorithm with Network Coding for Multicast Network
In today's practical networks, end-to-end information delivery is performed by routing. Network coding generalizes routing by allowing a node to generate output data by mixing (i.e., computing certain functions of) its r...
Digital Image Search & Retrieval using FFT Sectors of Color Images
Abstract- This paper presents the method developed to search and retrieve similar images from a large database. The Fourier transform is used to generate the feature vectors based on the mean values of real and imaginary...