Page Header Logo
TEI of Athens eJournals

Valley based vertical partitioning in distributed database

Sumti Medhavi, Akhilesh Kumar

Abstract


A Vertical Partitioning approach is defined as the method of dividing the attributes of a relation. An efficient Vertical Partitioning method always puts frequently accessed attributes of a relation together in a fragment. Various Partitioning algorithms have been proposed by several researchers. Still there is a scope of further improvement in previously developed algorithms. In this paper a new algorithm is proposed for Vertical Partitioning in Distributed Database. The proposed algorithm is named as Valley Based Vertical Partitioning Algorithm (VBVPA).This algorithm makes use of Clustered Affinity Matrix (CAM), which is derived using Attribute Usage Matrix (AUM) and Frequency Matrix (FM)


Keywords


Vertical Partitioning or Fragmentation, Attribute Usage Matrix, Frequency Matrix, Attribute Affinity Matrix, Bond Energy Algorithm, Bond Matrix, Clustered Affinity Matrix

Full Text: PDF

DOI: 10.26265/e-jst.v10i4.3077

Refbacks

  • There are currently no refbacks.

The application for presenting electronic journals TEI developed within subproject 2 "electronic publishing service" the Act "Development Services Digital Library of TEI" and financed by the operational program "Digital Convergence", NSRF 2007-2013.