{"title":"CODASYL环境中物理访问路径选择的近似算法","authors":"P. Rullo, D. Saccá, Qinsi Zhong","doi":"10.1109/ICDE.1986.7266221","DOIUrl":null,"url":null,"abstract":"A heuristic algorithm for the selection of an optimal access path configuration for CODASYL databases is presented. This algorithm is based on the idea of extending index selection techniques proposed for relational systems to COD ASYL systems. The proposed approach has the worth effacing the physical design problem in a unified way; moreover, it allows for covering a large spectrum of physical decision variables, namely, location modes, set implementations, set orders and search keys.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"255 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An approximation algorithm for the physical access path selection in the CODASYL environment\",\"authors\":\"P. Rullo, D. Saccá, Qinsi Zhong\",\"doi\":\"10.1109/ICDE.1986.7266221\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A heuristic algorithm for the selection of an optimal access path configuration for CODASYL databases is presented. This algorithm is based on the idea of extending index selection techniques proposed for relational systems to COD ASYL systems. The proposed approach has the worth effacing the physical design problem in a unified way; moreover, it allows for covering a large spectrum of physical decision variables, namely, location modes, set implementations, set orders and search keys.\",\"PeriodicalId\":415748,\"journal\":{\"name\":\"1986 IEEE Second International Conference on Data Engineering\",\"volume\":\"255 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-02-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1986 IEEE Second International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1986.7266221\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1986 IEEE Second International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1986.7266221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An approximation algorithm for the physical access path selection in the CODASYL environment
A heuristic algorithm for the selection of an optimal access path configuration for CODASYL databases is presented. This algorithm is based on the idea of extending index selection techniques proposed for relational systems to COD ASYL systems. The proposed approach has the worth effacing the physical design problem in a unified way; moreover, it allows for covering a large spectrum of physical decision variables, namely, location modes, set implementations, set orders and search keys.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
