Results 1 
4 of
4
Vertical Partitioning Algorithms for Database Design
 ACM Transactions on Database Systems
, 1984
"... This paper addresses the vertical partitioning of a set of logical records or a relation into fragments. The rationale behind vertical partitioning is to produce fragments, groups of attribute columns, that “closely match ” the requirements of transactions. Vertical partitioning is applied in three ..."
Abstract

Cited by 89 (9 self)
 Add to MetaCart
This paper addresses the vertical partitioning of a set of logical records or a relation into fragments. The rationale behind vertical partitioning is to produce fragments, groups of attribute columns, that “closely match ” the requirements of transactions. Vertical partitioning is applied in three contexts: a database stored on devices of a single type, a database stored in different memory levels, and a distributed database. In a twolevel memory hierarchy, most transactions should be processed using the fragments in primary memory. In distributed databases, fragment allocation should maximize the amount of local transaction processing. Fragments may be nonoverlapping or overlapping. A twophase approach for the determination of fragments is proposed; in the first phase, the design is driven by empirical objective functions which do not require specific cost information. The second phase performs cost optimization by incorporating the knowledge of a specific application environment. The algorithms presented in this paper have been implemented, and examples of their actual use are shown. 1.
Modeling the Storage Architectures of Commercial Database Systems
 ACM Transactions on Database Systems
, 1985
"... Modeling the storage structures of a DBMS is a prerequisite to understanding and optimizing database performance. Previously, such modeling was very difficult because the fundamental role of conceptualtointernal mappings in DBMS implementations went unrecognized. In this paper we present a model o ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
(Show Context)
Modeling the storage structures of a DBMS is a prerequisite to understanding and optimizing database performance. Previously, such modeling was very difficult because the fundamental role of conceptualtointernal mappings in DBMS implementations went unrecognized. In this paper we present a model of physical databases, called the transformation model, that makes conceptualtointernal mappings explicit. By exposing such mappings, we show that it is possible to model the storage architectures (i.e., the storage structures and mappings) of many commercial DBMSs in a precise, systematic, and comprehendible way. Models of the INQUIRE, ADABAS, and SYSTEM 2000 storage architectures are presented as examples of the model’s utility. We believe the transformation model helps bridge the gap between physical database theory and practice. It also reveals the possibility of a technology to automate the development of physical database software.
An Objective Function for Vertically Partitioning Relations in Distributed Databases and its Analysis
, 1992
"... The design of distributed databases is an optimization problem requiring solutions to several interrelated problems including: data fragmentation, allocation, and local optimization. Each problem can be solved with several different approaches thereby making the distributed database design a very di ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
The design of distributed databases is an optimization problem requiring solutions to several interrelated problems including: 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 general vertical partitioning problem formally. We first provide a comparison of work in the area of data clustering and distributed databases to highlight the thrust of this work. We derive an objective function that generalizes and subsumes earlier work on vertical partitioning in databases. The objective function developed in this paper provides a basis for developing heuristic algorithms for vertical partitioning. The objective function also facilitates ...
A Formal Approach to the Vertical Partitioning Problem in Distributed Database Design
 In Technical Report. CIS Dept, Univ. of
, 1993
"... 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 ta ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
(Show Context)
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 nary 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...