DocumentCode
2627114
Title
An efficient storage protocol for distributed object oriented databases
Author
Min He ; Hurson, A. ; Miller, Lee Dee ; Sheth, D.
Author_Institution
Dept. of Comput. Sci., Iowa State Univ., Ames, IA
fYear
1993
fDate
1-4 Dec 1993
Firstpage
606
Lastpage
610
Abstract
In object oriented databases, objects are connected to each other by various kinds of relationships and form a general directed graph. The idea of leveled clustering is utilized to take advantage of the relationships and solve the problem of object allocation and storage in a distributed object oriented database. Both nonreplicative and replicative algorithms are developed to allocate objects to different sites and organize them in the storage of the local databases
Keywords
directed graphs; distributed databases; object-oriented databases; protocols; resource allocation; storage management; distributed object oriented databases; efficient storage protocol; general directed graph; leveled clustering; object oriented databases; replicative algorithms; Clustering algorithms; Computer science; Data models; Distributed databases; Helium; Object oriented databases; Object oriented modeling; Object oriented programming; Protocols; Relational databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-4222-X
Type
conf
DOI
10.1109/SPDP.1993.395479
Filename
395479
Link To Document