Please use this identifier to cite or link to this item:
Title: Vertical partitioning in object oriented databases
Authors: Gajanan S. Chinchwadkar
Keywords: DRNTU::Engineering::Computer science and engineering::Information systems::Database management
Issue Date: 1997
Abstract: 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.
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SAS Theses

Files in This Item:
File Description SizeFormat 
  Restricted Access
16.3 MBAdobe PDFView/Open

Page view(s)

checked on Sep 30, 2020


checked on Sep 30, 2020

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.