## A Formal Approach to the Vertical Partitioning Problem in Distributed Database Design (1993)

Venue: | In Technical Report. CIS Dept, Univ. of |

Citations: | 11 - 2 self |

### BibTeX

@INPROCEEDINGS{Muthuraj93aformal,

author = {J. Muthuraj and S. Chakravarthy and R. Varadarajan and S. B. Navathe},

title = {A Formal Approach to the Vertical Partitioning Problem in Distributed Database Design},

booktitle = {In Technical Report. CIS Dept, Univ. of},

year = {1993},

pages = {26--34}

}

### Years of Citing Articles

### OpenURL

### Abstract

The design of distributed databases is an optimization problem requiring solutions to several interrelated problems: data fragmentation, allocation, and local optimization. Each problem can be solved with several different approaches thereby making the distributed database design a very difficult task. Although there is a large body of work on the design of data fragmentation, most of them are either ad hoc solutions or formal solutions for special cases (e. g., binary vertical partitioning). In this paper, we address the problem of n-ary vertical partitioning problem and derive an objective function that generalizes and subsumes earlier work. The objective function derived in this paper is being used for developing heuristic algorithms that can be shown to satisfy the objective function. The objective function is also being used for comparing previously proposed algorithms for vertical partitioning. We first derive an objective function that is suited to distributed transaction proces...

### Citations

2146 | Dubes RC, “Algorithms for Clustering Data - Jain, C - 1988 |

483 | Principles of Distributed Database Systems - Valduriez - 1991 |

245 | Graph-theoretical methods for detecting and describing gestalt clusters
- Zahn
- 1971
(Show Context)
Citation Context ...ionally used in pattern recognition and statistics, some of which can be adapted to partitioning of a database. These data clustering algorithms include Square-error clustering [9], Zahn's clustering =-=[22]-=-, Nearest-neighbor clustering [11] and Fuzzy [9]clustering. The partitioning algorithms mentioned above use some heuristics to create fragments of a relation. The input to most of these algorithms is ... |

85 | Vertical partitioning algorithms for database design
- Navathe, Ceri, et al.
- 1984
(Show Context)
Citation Context ...be found in Muthuraj's thesis [14]. Vertical Partitioning (also called attribute partitioning) is a technique that is used during the design of a database to improve the performance of 2 transactions =-=[15]-=-. In vertical partitioning, attributes of a relation R 3 are clustered into nonoverlapping 4 groups and the relation R is projected into fragment relations according to these attribute groups. In dist... |

64 |
Vertical Partitioning in Database Design: A Graphical Algorithm
- Navathe, Ra
- 1989
(Show Context)
Citation Context ...tor values above are the minimum of the values where the second component of the PE is calculated using optimistic (minimum value) estimate. For this particular example, other algorithms such as Ra's =-=[16]-=-, Zahn's [22] and Binary Vertical Partitioning [15] identify the above mentioned partition set (i.e., 3 fragments) as optimum. In Zahn's approach, once the maximum spanning tree is obtained two differ... |

46 |
A sentence-to-sentence clustering procedure for pattern analysis
- Lu, Fu
- 1978
(Show Context)
Citation Context ...n and statistics, some of which can be adapted to partitioning of a database. These data clustering algorithms include Square-error clustering [9], Zahn's clustering [22], Nearest-neighbor clustering =-=[11]-=- and Fuzzy [9]clustering. The partitioning algorithms mentioned above use some heuristics to create fragments of a relation. The input to most of these algorithms is an Attribute Usage Matrix (AUM). A... |

46 |
Problem decomposition and data reorganization by a clustering technique
- McCormick, Schweitzer, et al.
(Show Context)
Citation Context ...n the literature. Hoffer and Severance [7] measure the affinity between pairs of attributes and try to cluster attributes according to their pairwise affinity by using the bond energy algorithm (BEA) =-=[12]. Hammer a-=-nd Niamir [6] use a file design cost estimator and a heuristic to arrive at a "bottom up" partitioning scheme. Navathe, et al [15] extend the BEA approach and propose a two phase approach fo... |

40 | Distribution design of logical database schemas - Ceri, Navathe, et al. - 1983 |

22 | A vertical partitioning algorithm for rela-tional databases - Cornell, Yu - 1987 |

19 | A Heuristic Approach to Attribute Partitioning - Hammer, Niamir - 1979 |

13 |
analysis using seed points and density-determined hyperspheres with an application to global optimization
- Torn, Cluster
(Show Context)
Citation Context ...also be viewed as regions of the attribute pattern space in which the patterns are dense, separated by regions of low attribute pattern density. In the mode-seeking partitioning algorithm due to Torn =-=[21]-=-, clusters are identified by searching for regions of high density, called modes, in the pattern space. Each mode is associated with a cluster center and each pattern is assigned to the cluster with t... |

8 |
A locally sensitive method for cluster analysis
- Kittler
- 1976
(Show Context)
Citation Context ...by the Gestalt principle, which favors the grouping of attribute patterns based on Euclidean distance measure. Shaffer et al [19] demonstrate the similarity of the mode-seeking partitioning algorithm =-=[10] to the gr-=-aph algorithm of Zahn [22] based on minimum spanning trees. Lu and Fu [11] used another graph-based approach called "Nearest-Neighbor clustering algorithm" to cluster patterns during charact... |

8 | Space and time savings through large data base compression and dynamic restructuring - Alsberg - 1975 |

7 | Principles of distributed database systems (2nd ed - TAMER, VALDURIEZ - 1999 |

4 |
The determination of efficient record segmentation and blocking factors for share data files
- March, Severance
- 1977
(Show Context)
Citation Context ...e total costs of access, transfer, and storage for subtuples in both primary and secondary subfiles. The limitation of this approach is that at most two subfiles are allowed [17]. March and Severance =-=[13]-=- extended this model to incorporate block factors for both primary and secondary memories. Hoffer and Severance [7] grouped the attributes of a relation based on the extent to which they were used tog... |

4 |
Attribute Partitioning in a Self-Adaptive Relational Database System
- Niamir
- 1978
(Show Context)
Citation Context ...nonlinear, and measures the total costs of access, transfer, and storage for subtuples in both primary and secondary subfiles. The limitation of this approach is that at most two subfiles are allowed =-=[17]-=-. March and Severance [13] extended this model to incorporate block factors for both primary and secondary memories. Hoffer and Severance [7] grouped the attributes of a relation based on the extent t... |

4 | D.G.: Mathematical Techniques for E cient Record Segmentation in Large Shared Databases - Eisner, Severance - 1976 |

3 |
Single-link characteristics of a mode-seeking algorithm
- Shaffer, Dubes, et al.
- 1979
(Show Context)
Citation Context ...ree (MST) can be used to detect clusters. His choice of MST was influenced by the Gestalt principle, which favors the grouping of attribute patterns based on Euclidean distance measure. Shaffer et al =-=[19]-=- demonstrate the similarity of the mode-seeking partitioning algorithm [10] to the graph algorithm of Zahn [22] based on minimum spanning trees. Lu and Fu [11] used another graph-based approach called... |

3 | Optimization Problems and Solution Methods in the Design of Data distribution - Ceri, Pernici, et al. - 1989 |

3 | On Optimal Extracting from a Multiple File Data Storage System: an Application of Integer Programming - DAY - 1965 |

3 | The Use of Cluster Analysis - A, Severance - 1975 |

2 | Self-organizing Data Management Systems - Stocker, Dearnley - 1973 |

2 | Data Fragmentation and Allocation Algorithms For Distributed Database Design - Ra - 1990 |

1 |
A Clustering Algorithm for Hierarchical Structures
- Schkolnic
- 1977
(Show Context)
Citation Context ...ocessing cost could be minimized. Vertical partitioning also has its use in partitioning individual files in centralized databases, and dividing data among different levels of memory hierarchies etc. =-=[15, 18]-=-. In the case of distributed database design, transaction processing cost is minimized by increasing the local processing of transactions (at a site) as well as by reducing the amount of accesses to d... |

1 | A record and le partitioning model - Babad - 1977 |

1 | On Designing Generalized File Records for Management Information Systems - Benner - 1967 |

1 | An integer programming formulation of computer database design problems - er - 1976 |

1 | The Use of Access Frequencies in DataBase Organization - Kennedy - 1973 |

1 | A File Partitioning Model Cal - Kennedy - 1972 |

1 | The determination of e cient record segmentation and blocking factors for share data les - March, Severance - 1977 |

1 | The Partitioning of a DataBase into Supplies Matching User's Queries - Osman |

1 | De nition of Extraction Files and Their Optimization by Zero-one programming - Seppala |

1 | On the Optimal Properties of a Partition Algorithm - Yue, Wong - 1972 |