CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

An Algorithmic Model Scenario for Fragment Allocation to Handle Transaction Conflicts in Heterogeneous Distributed Databases

Published on March 2013 by Dharavath Ramesh, Chiranjeev Kumar
journal_cover_thumbnail

International Conference on Computing, Communication and Sensor Network
Foundation of Computer Science USA
CCSN2012 - Number 4
March 2013
Authors: Dharavath Ramesh, Chiranjeev Kumar
f92b9956-325b-488a-ba8a-ce249972c585

Dharavath Ramesh, Chiranjeev Kumar . An Algorithmic Model Scenario for Fragment Allocation to Handle Transaction Conflicts in Heterogeneous Distributed Databases. International Conference on Computing, Communication and Sensor Network. CCSN2012, 4 (March 2013), 34-39.

@article{
author = { Dharavath Ramesh, Chiranjeev Kumar },
title = { An Algorithmic Model Scenario for Fragment Allocation to Handle Transaction Conflicts in Heterogeneous Distributed Databases },
journal = { International Conference on Computing, Communication and Sensor Network },
issue_date = { March 2013 },
volume = { CCSN2012 },
number = { 4 },
month = { March },
year = { 2013 },
issn = 0975-8887,
pages = { 34-39 },
numpages = 6,
url = { /specialissues/ccsn2012/number4/10876-1042/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 International Conference on Computing, Communication and Sensor Network
%A Dharavath Ramesh
%A Chiranjeev Kumar
%T An Algorithmic Model Scenario for Fragment Allocation to Handle Transaction Conflicts in Heterogeneous Distributed Databases
%J International Conference on Computing, Communication and Sensor Network
%@ 0975-8887
%V CCSN2012
%N 4
%P 34-39
%D 2013
%I International Journal of Computer Applications
Abstract

The design of fragmentation is the first problem that must be solved in the design of data distribution. The purpose of fragmentation design is to determine non- overlapping fragments which are logical units of allocation at different sites that are appropriate for the data allocation. For a distributed database system to function efficiently, the fragments of the database need to be located at various sites across the communication network. The problem of allocating these fragments to the most appropriate sites is a difficult one to solve, however, with most approaches available relying on heuristic techniques. A data conflict between component databases is a crucial problem in building multi-database systems. This paper presents a framework and algorithmic model for classifying these conflicts.

References
  1. A. M. Tamhankar and S. Ram, "Database fragmentation and allocation: an integrated methodology and case study," IEEE Transactions on Systems, Man, and Cybernetics- Part A: Systems and Humans, Vol. 28, No. 3, 1998, pp. 288-305.
  2. M. S. Muro, T. Ibaraki, H. Miyajima, and T. Hasegawa, "Evaluation of file redundancy in distributed database systems," IEEE Transactions on Software Engineering, Vol. 11, No. 2, 1985, pp. 199-205.
  3. G. M. Chiu and C. S. Raghavendra, "A model for optimal database allocation in distributed computing systems," in Proceedings of IEEE INFOCOM '90, 1990, pp.
  4. 827-833. Bellatreche,L. ,Karlapalem,K. ,and Simonet, M. vertical fragmentation in distributed object database system with complex attributes and methods. (DEXA)(1996).
  5. M. K. Fisher and D. S. Hochbaum, "Database allocation in computer networks," Journal ACM, Vol. 27, No. 4, 1980, pp. 718-735.
  6. S. K. Chang and A. C. Liu, "File allocation in a distributed database," International Journal of Computer Information Sciences, Vol. 11, No. 5, 1982, pp. 325-340.
  7. M. T. ¨Ozsu and P. Valduriez, Principles of Distributed Database Systems. New Jersey: Alan Apt, 1999.
  8. S. Ceri, G. Martella, and G. Pelagatti, "Optimal file allocation in a computer network: a solution method based on the knapsack problem," Computer Network, Vol. 6, No. 5, 1982, pp. 345-357.
  9. M. Yoshida, K. Mizumachi, A. Wakino, I. Oyake, and Y. Matsushita, "Time and cost evaluation schemes of multiple copies of data in distributed database systems," IEEE Transactions on Software Engineering, Vol. 11, No. 9, 1985, pp. 954-958.
  10. X. Lin, M. Orlowska, and Y. Zhang, "On data allocation with the minimum overall communication costs in distributed database design," in Proceedings of the Fifth International Conference on Computing and Information, 1993, pp. 539-544.
  11. S. T. March and S. Rho, "Allocating data and operations to nodes in distributed database design," IEEE Transactions on Knowledge and Data Engineering, Vol. 7, No. 2, 1995, pp. 305-317.
  12. L. W. Dowdy and D. V. Foster, "Comparative models of the file assignment problem," ACM Computing Survey, Vol. 14, No. 2, 1982, pp. 287-313.
Index Terms

Computer Science
Information Sciences

Keywords

Distributed Databases Non-redundant Allocation Reformulation Fragment Allocation Allocation Model