{"title":"FRAGTIQUE: an OO distribution design methodology","authors":"M. Savonnet, M. Terrasse, K. Yétongnon","doi":"10.1109/DASFAA.1999.765762","DOIUrl":null,"url":null,"abstract":"We present an OO distribution design methodology based on a ponderated graph called Class Dependency Graph (CDG) which captures structural relationships and query 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: to evaluate the quality of the fragmentation process; and as a metric for the allocation pre-treatment which is based on a distance strings algorithm.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASFAA.1999.765762","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
We present an OO distribution design methodology based on a ponderated graph called Class Dependency Graph (CDG) which captures structural relationships and query 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: to evaluate the quality of the fragmentation process; and as a metric for the allocation pre-treatment which is based on a distance strings algorithm.