Non-Redundant Dynamic Fragment Allocation with Horizontal Partition in Distributed Database System

Lwin, Nang Khine Zar; Naing, Tin Myint

doi:10.1109/iciibms.2018.8550032

Cited by 3 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 5 shows the number of proposals related to each type of fragmentation. Articles [ 1 , 2 , 3 , 38 , 39 , 40 , 41 , 42 , 43 , 44 , 45 , 46 , 47 , 48 , 49 , 50 , 51 , 52 , 53 , 54 , 55 , 56 , 57 , 58 , 59 , 60 , 61 , 62 , 63 , 64 , 65 , 66 ] focus on horizontal fragmentation; while [ 7 , 22 , 23 , 24 , 25 , 26 , 27 , 28 , 29 , 30 , 31 , 32 , 33 , 34 , 35 , 36 , 37 ] consider vertical partitioning, [ 67 , 68 , 69 , 70 , 71 , 72 ,…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Application of Dynamic Fragmentation Methods in Multimedia Databases: A Review

Castro-Medina

Rodríguez-Mazahua

López-Chau

et al. 2020

Entropy

View full text Add to dashboard Cite

Fragmentation is a design technique widely used in multimedia databases, because it produces substantial benefits in reducing response times, causing lower execution costs in each operation performed. Multimedia databases include data whose main characteristic is their large size, therefore, database administrators face a challenge of great importance, since they must contemplate the different qualities of non-trivial data. These databases over time undergo changes in their access patterns. Different fragmentation techniques presented in related studies show adequate workflows, however, some do not contemplate changes in access patterns. This paper aims to provide an in-depth review of the literature related to dynamic fragmentation of multimedia databases, to identify the main challenges, technologies employed, types of fragmentation used, and characteristics of the cost model. This review provides valuable information for database administrators by showing essential characteristics to perform proper fragmentation and to improve the performance of fragmentation schemes. The reduction of costs in fragmentation methods is one of the most desired main properties. To fulfill this objective, the works include cost models, covering different qualities. In this analysis, a set of characteristics used in the cost models of each work is presented to facilitate the creation of a new cost model including the most used qualities. In addition, different data sets or reference points used in the testing stage of each work analyzed are presented.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Zar Lwin & Naing [ 65 ] proposed an approach for the dynamic allocation of non-redundant fragments in a distributed database system. The implementation was carried out on four fully connected cloud sites, in which 10,000 queries were executed.…”

Section: Description Of the Set Of Work By Categorymentioning

confidence: 99%

Application of Dynamic Fragmentation Methods in Multimedia Databases: A Review

Castro-Medina

Rodríguez-Mazahua

López-Chau

et al. 2020

Entropy

View full text Add to dashboard Cite

show abstract

Efficient separation and allocation of dataset in structured and unstructured databases

Rajkumar¹,

Radhika

Karthika³

2021

Materials Today: Proceedings

View full text Add to dashboard Cite

On K-means clustering-based approach for DDBSs design

Amer

2020

J Big Data

View full text Add to dashboard Cite

In Distributed Database Systems (DDBS), communication costs and response time have long been open-ended challenges. Nevertheless, when DDBS is carefully designed, the desired reduction in communication costs will be achieved. Data fragmentation (data clustering) and data allocation are on popularity as the prime strategies in constant use to design DDBS. Based on these strategies, on the other hand, several design techniques have been presented in the literature to improve DDBS performance using either empirical results or data statistics, making most of them imperfect or invalid particularly, at least, at the initial stage of DDBSs design. In this paper, thus, a heuristic k-means approach for vertical fragmentation and allocation is introduced. This approach is primarily focused on DDBS design at the initial stage. Many techniques are being joined in a step to make a promising work. A brief yet effective experimental study, on both artificially-created and real datasets, has been conducted to demonstrate the optimality of the proposed approach, comparing with its counterparts, as the obtained results has been shown encouraging.

show abstract

Non-Redundant Dynamic Fragment Allocation with Horizontal Partition in Distributed Database System

Cited by 3 publications

References 13 publications

Application of Dynamic Fragmentation Methods in Multimedia Databases: A Review

Application of Dynamic Fragmentation Methods in Multimedia Databases: A Review

Efficient separation and allocation of dataset in structured and unstructured databases

On K-means clustering-based approach for DDBSs design

Contact Info

Product

Resources

About