An integer linear programming approach to data allocation with the minimum total communication cost in distributed database systems

1995 ◽  
Vol 85 (1-3) ◽  
pp. 1-10 ◽  
Author(s):  
Xuemin Lin ◽  
Maria Orlowska
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Database Systems ◽  
Distributed Database ◽  
Communication Cost ◽  
Programming Approach ◽  
Data Allocation ◽  
Distributed Database Systems ◽  
Linear Programming Approach ◽  
Total Communication

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.

Sign in / Sign up

Export Citation Format

Share Document