An improved vertical fragmentation, allocation and replication for enhancing e‐learning in distributed database environment

2020 ◽  
Author(s):  
P. Sathishkumar ◽  
M. Gunasekaran
Keyword(s):  
Distributed Database ◽  
Vertical Fragmentation ◽  
E Learning

Localization of Data Sets in Distributed Database Systems Using Slope-Based Vertical Fragmentation

2020 ◽  
pp. 36-60
Author(s):  
Ashish Ranjan Mishra ◽  
Neelendra Badal
Keyword(s):  
Database Systems ◽  
Distributed Database ◽  
Communication Cost ◽  
Data Sets ◽  
Distributed Database Systems ◽  
The Third ◽  
Vertical Partitioning ◽  
Vertical Fragmentation ◽  
Partitioning Algorithm ◽  
Better Than

This chapter explains an algorithm that can perform vertical partitioning of database tables dynamically on distributed database systems. After vertical partitioning, a new algorithm is developed to allocate that fragments to the proper sites. To accomplish this, three major tasks are performed in this chapter. The first task is to develop a partitioning algorithm, which can partition the relation in such a way that it would perform better than most of the existing algorithms. The second task is to allocate the fragments to the appropriate sites where allocating the fragments will incur low communication cost with respect to other sites. The third task is to monitor the change in frequency of queries at different sites as well as same site. If the change in frequency of queries at different sites as well as the same site exceeds the threshold, the re-partitioning and re-allocation are performed.

A Novel Query-Driven Clustering-Based Technique for Vertical Fragmentation and Allocation in Distributed Database Systems

2017 ◽  
Vol 13 (2) ◽  
pp. 27-54 ◽  
Author(s):  
Adel A. Sewisy ◽  
Ali A. Amer ◽  
Hassan I. Abdalla
Keyword(s):  
Database Systems ◽  
Distributed Database ◽  
Communication Costs ◽  
Design Objective ◽  
Empirical Results ◽  
Distributed Database Systems ◽  
Allocation Process ◽  
Vertical Fragmentation ◽  
Initial Stage ◽  
Data Statistics

In this paper, heuristic query-driven clustering-based vertical fragmentation technique is efficiently developed. The intrinsic idea is to meet the idealistic case of DDBS design which comes to happen as each query attune “closely match” its relevant fragment. The proposed technique is mainly sought to breed clusters of queries in the first place. Consequently, these clusters would be tacitly used to generate intended disjoint fragments. Moreover, the allocation process has been considered so that replicated and non-replicated scenarios of data are applied. This technique basically meant to be efficaciously applicable at the initial stage of DDBS design without the need for data statistics or empirical results, in either dynamic or static DDBS environment. Many existing design-related techniques are being incorporated to make a promising work, particularly as communication costs being the foremost design objective. Throughout this work, the experimental results and internal evaluation are extensively illustrated to demonstrate the effectiveness and validity of proposed technique.

Fragmentation in Distributed Database Design Based on Ant Colony Optimization Technique

2019 ◽  
Vol 9 (2) ◽  
pp. 28-37
Author(s):  
Van Nghia Luong ◽  
Vijender Kumar Solanki ◽  
Nguyen Ha Huy Cuong
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Technique ◽  
Large Data ◽  
Database Design ◽  
Distributed Database ◽  
Ant Colony ◽  
Distributed Data ◽  
Clustering Techniques ◽  
Vertical Fragmentation ◽  
Distributed Database Design

Distributed database design solutions depend heavily on the exploitation of input data sources by using clustering techniques in data mining. A new approach of biomimetic computation systems such as ant colony optimization (ACO) for this solution is of interest to informatics experts. Using ACO techniques for this solution has the advantages such as faster algorithms thanks to the randomness of ant colony behavior. The use of random numbers based on heuristic information to pickup (drop) points will facilitate the flexible search on a large data space, so that it provides us with a better answer. In this article, the authors present ACO algorithms application solutions to clustering techniques for the problem of vertical fragmentation of distributed data.

scholarly journals EXPERIENCE API – НОВИЙ СТАНДАРТ ПРОГРАМНИХ ЗАСОБІВ ДЛЯ Е-НАВЧАННЯ ТА ПРИКЛАДИ ЙОГО ПРАКТИЧНОГО ВИКОРИСТАННЯ

2016 ◽  
Vol 53 (3) ◽  
pp. 150
Author(s):  
Oleksandr A. Shcherbyna
Keyword(s):  
Learning Process ◽  
Informal Education ◽  
Distributed Database ◽  
Data Representation ◽  
Educational Institutions ◽  
E Learning ◽  
Data Transfers ◽  
Learning Software

The purpose of the article is to analyze features of the new standard of e-learning software - Experience API (xAPI), previously also known as the Tin Can API. The standard defines a way of interaction between xAPI-clients – software which students work with while e-learning process, and xAPI-servers – Learning Record Stores (LRS), which store data about their results. Standard also defines LRS data representation format and a way of data transfers between LRS, which makes it possible to combine several LRS into distributed database that could accumulate information about people training in formal, non-formal and informal education throughout life. The article contains review of available xAPI-clients, xAPI-servers, and the results of their testing, which prove the possibility of their usage in our educational institutions.

scholarly journals Slop based Partitioning for Vertical Fragmentation in Distributed Database System

2014 ◽  
Vol 99 (4) ◽  
pp. 18-22
Author(s):  
Ashish RanjanMishra ◽  
Neelendra Badal
Keyword(s):  
Distributed Database ◽  
Database System ◽  
Vertical Fragmentation ◽  
Distributed Database System

scholarly journals PENERAPAN ARSITEKTUR THREE-TIER TERHADAP OPTIMALISASI KEAMANAN DISTRIBUTED DATABASE

CCIT Journal ◽  
2010 ◽  
Vol 3 (3) ◽  
pp. 345-365
Author(s):  
Muhammad Yusup ◽  
Untung Rahardja ◽  
Eko Prasetiyani
Keyword(s):  
Distributed Database ◽  
Ip Address ◽  
Database Server ◽  
E Learning ◽  
Password Management

Seiring dengan kemcjuan teknologi informasi dan laju perkembangannya yang semakin pesat mendorong adanya perkembangan tingkat keamanan pada sistem database server. Tingkat keamanan tersebut ditir jau dari berbagai tier, baik pada Application Tier, Database Tier, maupun Network Tier. Namun penerapan keamanan sistem database server saat ini baru sebatas pada Application Tier saja, misalnya penerapan hak akses user dengan 1P Token, IP Address, Mac Address serta Global Password Management (GPM) pada server RME. Untuk keamanan Network Tier sudah diatur melalui router, tetapi keamanan dari Database Tier belum disentuh dengan baik. Saat ini Server RME masih menggunakan konsep Two-Tier, yaitu antara Database Tier dan Application Tier masih berada dalam satu server, menggunakan Windows Authentication sebagai hak akses user pada sisi database. Sehingga penerapan tersebut tentunya sangat rentan terhadap keamanan sistem database server, dimana perintah-perintah SQL yang dijalankan oleh user sulit untuk dikendalikan karena belum diterapkannya User Mapping dan Server Roles pada database. Dari permasalahan tersebut maka server RME dengan konsep Two-Tier perlu dioptimalkan karena dapat memberikan dampak yang cukup signifikan terhadap kelangsungan 4 (empai) pilar IT E-learning di lingkungan Perguruan Tinggi Rahai ja. Untuk mengatasi hal tersebut maka dibutuhkan suatu konsep Three-Tier yang diterapkan pada server iRME. Dengan menggunakan Three-Tier, memungkinkan adanya pemisahan secara fisik antara Database Tier dan Application Tier pada server yang berbeda sehingga diharapkan dapat meningkatkan keamanan pada sisi database server. Arsitektur ini memiliki potensi untuk apkan backup server jika Application Tier mengalami masalah, memungkinkan juga diterapkan mirroring pada server iRME sebagai pengembangan lanjutan. Dapat disimpulkan bahwa dengan konsep Three-Tier ini dapat menjadi sebuah solusi terkini dalam meningkatkan keamanan database server di lingkungan Perguruan Tinggi Raharja.

A new vertical fragmentation algorithm based on ant collective behavior in distributed database systems

2011 ◽  
Vol 30 (2) ◽  
pp. 435-455 ◽  
Author(s):  
Mehdi Goli ◽  
Seyed Mohammad Taghi Rouhani Rankoohi
Keyword(s):  
Collective Behavior ◽  
Database Systems ◽  
Distributed Database ◽  
Distributed Database Systems ◽  
Vertical Fragmentation
Sign in / Sign up

Export Citation Format

Share Document