Vertical partitioning for database design: a graphical algorithm
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A Suite of Database Replication Protocols based on Group Communication Primitives
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
A General Approach to Analyzing Quorum-Based Heterogeneous Dynamic Data Replication Schemes
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Managing data using neighbour replication on a triangular-grid structure
International Journal of High Performance Computing and Networking
Branch replication scheme: A new model for data replication in large scale data grids
Future Generation Computer Systems
Efficient Hierarchical Quorums in Unstructured Peer-to-Peer Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
NETAPPS '10 Proceedings of the 2010 Second International Conference on Network Applications, Protocols and Services
Dynamic hybrid replication effectively combining tree and grid topology
The Journal of Supercomputing
Hi-index | 0.00 |
Replication usually referred as mechanism to increase availability and performance in distributed databases. Handling fragmented database replication becomes challenging issue since the distributed database is scattered into split fragments. Fragmentation in distributed database is very useful in terms of usage, efficiency, parallelism and also for security. In this paper, we manage fragmented database replication and transaction management using a new proposed algorithm called Binary Vote Assignment on Grid Quorum (BVAGQ). This technique combines replication and fragmentation. This strategy partition the database into disjoint fragments. The result shows that managing replication and transaction through proposed BVAGQ able to preserve data consistency. It also increases the degrees of parallelism. This is because by using fragmentation, replication and transaction can be divided into several sub-queries that operate on the fragments.