DocumentCode :
2471935
Title :
Partitioning schemes for object oriented databases
Author :
Karlaplem, Kamalakar ; Li, Qing
Author_Institution :
Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Kowloon, Hong Kong
fYear :
1995
fDate :
6-7 Mar 1995
Firstpage :
42
Lastpage :
49
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 an 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
Keywords :
distributed databases; object-oriented databases; optimisation; homogeneous distributed object oriented database systems; object oriented databases; optimization; partitioning schemes; query decomposition; transaction management; Computer science; Data models; Database systems; Distributed databases; Object oriented databases; Object oriented modeling; Object oriented programming; Partitioning algorithms; Query processing; Transaction databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Research Issues in Data Engineering, 1995: Distributed Object Management, Proceedings. RIDE-DOM '95. Fifth International Workshop on
Conference_Location :
Taipei
Print_ISBN :
0-8186-7056-8
Type :
conf
DOI :
10.1109/RIDE.1995.378746
Filename :
378746
Link To Document :
بازگشت