CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Slop based Partitioning for Vertical Fragmentation in Distributed Database System

by Ashish Ranjan Mishra, Neelendra Badal
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 99 - Number 4
Year of Publication: 2014
Authors: Ashish Ranjan Mishra, Neelendra Badal
10.5120/17360-7870

Ashish Ranjan Mishra, Neelendra Badal . Slop based Partitioning for Vertical Fragmentation in Distributed Database System. International Journal of Computer Applications. 99, 4 ( August 2014), 18-22. DOI=10.5120/17360-7870

@article{ 10.5120/17360-7870,
author = { Ashish Ranjan Mishra, Neelendra Badal },
title = { Slop based Partitioning for Vertical Fragmentation in Distributed Database System },
journal = { International Journal of Computer Applications },
issue_date = { August 2014 },
volume = { 99 },
number = { 4 },
month = { August },
year = { 2014 },
issn = { 0975-8887 },
pages = { 18-22 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume99/number4/17360-7870/ },
doi = { 10.5120/17360-7870 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:27:18.501659+05:30
%A Ashish Ranjan Mishra
%A Neelendra Badal
%T Slop based Partitioning for Vertical Fragmentation in Distributed Database System
%J International Journal of Computer Applications
%@ 0975-8887
%V 99
%N 4
%P 18-22
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A Vertical Partitioning is the process of dividing the attributes of a relation. Further, a good Vertical Partitioning puts frequently accessed attributes of the relation together in a fragment. Various researchers have proposed different algorithms for Vertical Partitioning. Still, there is a scope of improvement in previous algorithms for Vertical Partitioning. In this paper a new algorithm is proposed for Vertical Partitioning in Distributed Database System. The proposed algorithm is named as Slop Based Partitioning Algorithm (SBPA). This algorithm utilizes the Clustered Affinity Matrix (CAM), which is calculated from Attribute Usage Matrix (AUM) and Frequency Matrix (FM).

References
  1. Abuelyaman, E. S. , "An Optimized Scheme for Vertical Partitioning of a Distributed Database," in International Journal of Computer Science and Network Security (IJCSNS), Vol. 8, No. 1, January 2008, 310-316.
  2. Hoffer, J. A. and Severance, D. J. 1975. The use of cluster analysis in physical database design. In Proceedings of the 1st International Conference on Very Large Data Bases, New York, USA.
  3. Horowitz, E. and Sahni, S. 1978. Fundamentals of Computer Algorithms. Computer Science Press Rockville, Maryland.
  4. McCormick, W. T. Schweitzer P. J. , and White T. W. , "Problem Decomposition and Data Reorganization by A Clustering Technique," Operation Research, Vol. 20 No. 5, September 1972, 993-1009.
  5. Navathe, S. , Ceri, S. , Wierhold, G. and Dou, J. , "Vertical Partitioning Algorithms for Database Design," ACM Transactions on Database Systems, Vol. 9 No. 4, December 1984, 680-710.
  6. Navathe, S. and Ra M. , "Vertical Partitioning for Database Design: A Graph Algorithm," ACM Special Interest Group on Mamagement of Data (SIGMOD) International Conference on Management of Data, Vol. 18 No. 2, June 1989, 440-450.
  7. Chu, W. W. and Ieong, I. "A Transaction-Based Approach to Vertical Partitioning for Relational Database Systems," IEEE Transactions on Software Engineering, Vol. 19 No. 8, August 1993, 408-412.
  8. Bradley, P. S. , Fayyad, U. M. and Reina, C. , "Scaling Clustering Algorithms to Large Databases", in proceedings of the 4th International Conference on Knowledge Discovery & Data Mining , June 1998, 9-15.
  9. Guha, S. , Rastogi, R. and Shim, K. , "CURE: an efficient clustering algorithm for large databases", in proceedings of the 1998 ACM SIGMOD international conference on Management of data, Vol. 27, Issue 2, June 1998, 73-84.
  10. Ng, R. T. and. Han, J. , "Efficient and Effective Clustering Methods for Spatial Data Mining", Proceedings of the 20th International Conference on Very Large Data Bases, September 1994, 144-155.
  11. Jain, A. and Dubes, R. , "Algorithms for Clustering Data", Prentice Hall, New Jersey, 1998.
  12. Kaufman, L. , Rousseuw, P. , "Finding Groups in Data- An Introduction to Cluster Analysis", Wiley Series in Probability and Math. Sciences, 1990.
  13. Zhang, T. , Ramakrishnan, R. and Livny, M. , "An Efficient Data Clustering Method for Very Large Databases", in proceedings of the SIGMOD international conference on Management of data, June 1996, 103-114.
Index Terms

Computer Science
Information Sciences

Keywords

Vertical Partitioning Clustered Affinity Matrix Attribute Usage Matrix Frequency Matrix Distributed Database System Slop Based Partitioning Algorithm.

Powered by PhDFocusTM