Vertical partitioning in object oriented databases

Vertical partitioning in object oriented databases

Database partitioning is a useful technique for performance improvement in parallel and dis-tributed environments. Reported ways of partitioning object oriented database (ODB) classes include vertical, horizontal, mixed, path and method induced partitioning. This thesis provides method transformatio...

Full description

Saved in:
Bibliographic Details
Main Author: Gajanan S. Chinchwadkar
Other Authors: Goh, Angela Eck Soong
Format: Theses and Dissertations
Language:English
Published: 2009
Subjects:
DRNTU::Engineering::Computer science and engineering::Information systems::Database management
Online Access:http://hdl.handle.net/10356/20441
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:Database partitioning is a useful technique for performance improvement in parallel and dis-tributed environments. Reported ways of partitioning object oriented database (ODB) classes include vertical, horizontal, mixed, path and method induced partitioning. This thesis provides method transformations and cost analysis of vertical partitioning in parallel object oriented database systems (POBSs). A taxonomy for vertical partitioning schemes is proposed and it is used qualitatively to justify the need for new partitioning algorithms. A partitioning algorithm and support for transparency to applications in the partitioned database are two essential components of a vertical-partitioning processor. The thesis presents a unified view of the vertical partitioning problem which incorporates these two components.

Similar Items