Journal of EEIS
Current Result Document :
| 한글제목(Korean Title) |
A Horizontal Partition of the Object-Oriented Database for Efficient Clustering |
| 영문제목(English Title) |
A Horizontal Partition of the Object-Oriented Database for Efficient Clustering |
| 저자(Author) |
Chin-Wan Chung
Chang-Ryong Kim
Ju-Hong Lee
|
| 원문수록처(Citation) |
VOL 01 NO. 01 PP. 0164 ~ 0172 (1996. 03) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
The partitioning of related objects should be performed before clustering for an efficient access in object-oriented databases. In this paper, a horizontal partition of related objects in object-oriented databases is presented.
All subclass nodes in a class inheritance hierarchy of a schema graph are shrunk to a class node in the graph that is called condensed schema graph becuase the aggregation hierarchy has more influence on the partition that the class inhereitance hierarch. A set function and an accessibility function are defined to find a maximal subset of related objects amount the set of objects in a class. A set function maps a subset of the domain class objects to a jubset of the range class objects. An accessibility function maps a subset of the objects of a class into a subset of the objects of the same class through a composition of set functions. |
| 키워드(Keyword) |
System Software and Databases
Object-Oriented Database
Efficient Clustering
|
| 파일첨부 |
PDF 다운로드
|
