Name
Abstract | ||
|---|---|---|
We present an OO distribution design methodology based on a ponderated graph called Class Dependency Graph (CDG) which captures structural relationships and queries usage frequencies of an OO database.We characterize and select a set of methods for which parallel execution can be optimized. These methods determine the partitioning strategy and are used to partition the CDG into a set of partition trees representing a group of co-referenced classes which must be partitioned together.We define clustering strategy and flow measures which are used: 1) to evaluate the quality of the fragmentation process, 2) as a metric for the allocation pre-treatment which is based on a distance strings algorithm. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/DASFAA.1999.765762 | Hsinchu |
Keywords | Field | DocType |
partition tree,clustering strategy,distance strings algorithm,co-referenced class,oo distribution design methodology,partitioning strategy,design methodology,allocation pre-treatment,class dependency graph,oo distribution,oo database,flow measure,taxonomy,databases,distributed databases,tree data structures,flow measurement,graph theory,clustering algorithms | Graph theory,Data mining,Graph database,Computer science,Tree decomposition,Theoretical computer science,SPQR tree,Graph partition,Dependency graph,Graph (abstract data type),Moral graph,Database | Conference |
ISBN | Citations | PageRank |
0-7695-0084-6 | 11 | 3.83 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marinette Savonnet | 1 | 24 | 16.76 |
| Marie-Noëlle Terrasse | 2 | 22 | 9.25 |
| Kokou Yétongnon | 3 | 218 | 61.29 |