An Analysis of Vertical Splitting Algorithm

Bhaskar, Ruchika; Sharma, Rakesh

doi:10.5120/8304-1767

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A blocking for this type is very useful in a distributed database, where each sub-sets can contain data that generally have a property. Vertical fragmentation subdivides the attributes of an available global fragment into several groups or subclass (Bhaskar and Sharma, 2012). The simplest form of vertical fragmentation is decomposition, where a row of unique-id can be included in each fragment to ensure and enable the reconstruction process through join operations.…”

Section: Introductionmentioning

confidence: 99%

Query Optimization on Distributed Database Dengue Fever by Minimizing Attribute Involvement

Nurhendratno¹,

Sudaryanto²,

Budiman³

et al. 2018

Journal of Computer Science

View full text Add to dashboard Cite

Query optimization is an important task in a client/server environment of a distributed database, whereas a health epidemiologist data distribution based on DBD data on Geographic Information Systems (GIS). A proper method for a particular query process function is needed to generate query optimization on a distributed database. The query process requires important attention especially in distributed databases because the result of a cost-based query process is accessed by involving a number of attributes and visited sites. A query operation typically will search for data from various attributes in a scattered database table, although the processes do not require all table attributes. Query optimization requires minimum query operating costs (communication costs and access fees). The query cost can be optimized by separating attributes that are not required by the query. This can reduce the amount of communication and access time. The attributes should not be divided indiscriminately to obtain the best result of the query process and a vertical fragmentation method can be used to perform such attribute separation. In this research, attributes separation using vertical fragmentation method for a database health table is studied by comparing Bond Energy Algorithm (BEA) and Graphic Based Vertical Partitioning (GBVP) algorithm. The initial result of vertical fragmentation in both algorithms is the determination of types of attributes separated from a number of specific query process. The result of the separation of attributes from each algorithm is compared and evaluated using Partitioned Evaluator (PE) in order to achieve the access cost of several attributes. The results show that GBVP algorithm is more optimal for use in vertical table fragmentation process applied as query operation on distributed DBD database in a health field. The GBVP algorithm has less computational complexity, results a higher partition evaluator value and has lower query execution time than BEA.

show abstract

Section: Introductionmentioning

confidence: 99%