• Corpus ID: 14403155

A Mixed Fragmentation Methodology For Initial Distributed Database Design

@inproceedings{Navathe1995AMF,
  title={A Mixed Fragmentation Methodology For Initial Distributed Database Design},
  author={Shamkant B. Navathe and K. Karlapalem and Minyoung Ra},
  year={1995}
}
We deene mixed fragmentation as a process of simultaneously applying the horizontal and vertical fragmentation on a relation. It can be achieved in one of two ways: by performing horizontal fragmentation followed by vertical fragmentation or by performing vertical fragmentation followed by horizontal fragmentation. The need for mixed fragmentation arises in distributed databases because database users usually access subsets of data which are vertical and horizontal fragments of global relations… 

A Distribution Design Methodology for Object DBMS

TLDR
The analysis phase is responsible for driving the choice between the horizontal and the vertical partitioning techniques, or even the combination of both, in order to assist distribution designers in the fragmentation phase of object databases.

A THEORY REFINEMENT APPROACH TO THE DESIGN OF DISTRIBUTED OBJECT ORIENTED DATABASES

TLDR
A knowledge-based approach to the Design of Distributed Object Oriented Databases (DDOODB), through the use of Machine Learning, which addresses the Analysis Phase for the class fragmentation problem in the DDOODB context and represents a Revised Analysis Phase that will propose good fragmentation schemas with improved performance.

An optimized scheme for vertical fragmentation, allocation and replication of a distributed database

TLDR
The proposed scheme partitions the distributed database relations vertically at the initial stage of distributed database design, without the need for the frequency of user queries which are not available at this stage, and reduces the overheads and the complexity of complicated computations of previous vertical partitioning approaches.

Horizontal Fragmentation Technique in Distributed Database Ms .

TLDR
A fragmentation technique that can be applied at the initial stage as well as in later stages of a distributed database system for partitioning the relations is presented and shows that proposed technique can solve initial fragmentation problem of relational databases for distributed systems properly.

A New Technique for Database Fragmentation in Distributed Systems

TLDR
A fragmentation technique that can be applied at the initial stage as well as in later stages of a distributed database system for partitioning the relations is presented and shows that proposed technique can solve initial fragmentation problem of relational databases for distributed systems properly.

A comprehensive approach to horizontal class fragmentation in a Distributed Object Based System

TLDR
A taxonomy of the fragmentation problem in a distributed object base is reviewed and a comprehensive set of algorithms for horizontally fragmenting the four realizable class models on the taxonomy are presented, shown to be polynomial time.

Horizontal class fragmentation in distributed object based systems

TLDR
A taxonomy of the fragmentation problem in a distributed object based system capable of supporting systems engineering applications is presented and detailed horizontal fragmentation algorithms are presented for one of these class models using a top{down approach where the entity of fragmentation is the class object.

Dynamical Processing Technique for Data Fragmentation in Distributed Database Systems: Design and Tool Support

TLDR
A technique that splits the database relations into pair-wise disjoint fragments, which would be allocated to the DDBs sites during the process of allocation, and improves the applications speed and efficiency by minimizing the number of fragments to be accessed is proposed.

A Comprehensive Taxonomy of Fragmentation and Allocation Techniques in Distributed Database Design

TLDR
This article presents an attempt to propose a comprehensive taxonomy of the available fragmentation and allocation techniques in distributed database design and discusses some case studies of these techniques for a deeper understanding of its achievements and limitations.

Scalability and performance analysis of CRUD matrix based fragmentation technique for distributed database

  • S. I. KhanA. S. L. Hoque
  • Computer Science
    2012 15th International Conference on Computer and Information Technology (ICCIT)
  • 2012
TLDR
Experimental results show that the proposed fragmentation technique can solve initial fragmentation problem of distributed database system properly also compete with other non initial fragmentation techniques quite good in later stages.
...

References

SHOWING 1-10 OF 22 REFERENCES

Vertical partitioning algorithms for database design

TLDR
A two-phase 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, and the second phase performs cost optimization by incorporating the knowledge of a specific application environment.

A vertical partitioning algorithm for relational databases

TLDR
An optimal binary partitioning algorithm which can be recursively applied is developed based on an integer linear programming technique to minimize the number of disk accesses.

Vertical partitioning for database design: a graphical algorithm

TLDR
This paper proposes a new vertical partitioning algorithm which starts from the attribute affinity matrix by considering it as a complete graph and generates all meaningful fragments simultaneously by considering a cycle as a fragment.

Fragmenting Relations Horizontally Using a Knowledge-Based Approach

TLDR
In distributed DBMSs, one major issue in developing a horizontal fragmentation technique is what criteria to use to guide the fragmentation, so the authors propose to use particular knowledge about the data itself, identified in terms of five axiom schemata.

Horizontal data partitioning in database design

TLDR
The concepts which are required for the determination of relevant portions of data are defined and a methodology for determining the access parameters is proposed and the formulation of the general partitioning problem in 3 specific application environments is shown.

Distribution Design of Logical Database Schemas

TLDR
The optimal distribution of a database schema over a number of sites in a distributed network is considered and the design is driven by user-supplied information about data distribution.

A formal approach to the vertical partitioning problem in distributed database design

TLDR
The n-ary vertical partitioning problem is addressed, and an objective function that generalizes and subsumes earlier work is derived that provides a basis for developing heuristic algorithms for vertical partitions.

GAMMA - A High Performance Dataflow Database Machine

TLDR
The Gamma prototype shows how parallelism can be controlled with minimal control overhead through a combination of the use of algorithms based on hashing and the pipelining of data between processes.