Partitioning Schemes for Object Oriented Databases (1995)
| Venue: | in Proceeding of the Fifth International Workshop on Research Issues in Data Engineering- Distributed Object Management, RIDE-DOM'95 |
| Citations: | 11 - 4 self |
BibTeX
@INPROCEEDINGS{Karlapalem95partitioningschemes,
author = {Kamalakar Karlapalem and Qing Li},
title = {Partitioning Schemes for Object Oriented Databases},
booktitle = {in Proceeding of the Fifth International Workshop on Research Issues in Data Engineering- Distributed Object Management, RIDE-DOM'95},
year = {1995},
pages = {42--49}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In order to support homogeneous distributed object oriented database systems we need to have a clear understanding of what is meant by partitioning a class and what are the different ways of doing so. In this paper, we concentrate on studying the different types of class partitioning schemes that can arise in object oriented databases. By laying down the foundation by articulating the concepts, representation, and implementation approaches for partitioning object databases, we facilitate further work on partitioning algorithms, query decomposition, optimization and transaction management for distributed OODBMS. 1 Introduction Object oriented databases (OODBs) have been gaining popularity since late 80's when several OODBs became commercially available. Earlier work on OODBs has mainly concentrated on centralized database environments, and only more recently has OODBs technology been applied in distributed systems environments (e.g. client-server and and federated multiple-databases [...
