{"title":"贪心文件——部分匹配检索的一种新的数据组织概念","authors":"Yun-Huan Chou, Wei-Peng Yang, C. Chang","doi":"10.1109/CMPSAC.1989.65094","DOIUrl":null,"url":null,"abstract":"A method is presented for arranging a set of records into buckets to facilitate partial match retrieval. The idea is mainly motivated by the concept of optimal Cartesian product files. For a set of records, the method recursively partitions them into a collection of optimal Cartesian product files. A performance formula of this new file structure is derived and the superiority of this data organization concept is established. It is shown that the Cartesian product file is only a special case of the proposed file system.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Greedy file-a new data organization concept for partial match retrieval\",\"authors\":\"Yun-Huan Chou, Wei-Peng Yang, C. Chang\",\"doi\":\"10.1109/CMPSAC.1989.65094\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method is presented for arranging a set of records into buckets to facilitate partial match retrieval. The idea is mainly motivated by the concept of optimal Cartesian product files. For a set of records, the method recursively partitions them into a collection of optimal Cartesian product files. A performance formula of this new file structure is derived and the superiority of this data organization concept is established. It is shown that the Cartesian product file is only a special case of the proposed file system.<<ETX>>\",\"PeriodicalId\":339677,\"journal\":{\"name\":\"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1989.65094\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1989.65094","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Greedy file-a new data organization concept for partial match retrieval
A method is presented for arranging a set of records into buckets to facilitate partial match retrieval. The idea is mainly motivated by the concept of optimal Cartesian product files. For a set of records, the method recursively partitions them into a collection of optimal Cartesian product files. A performance formula of this new file structure is derived and the superiority of this data organization concept is established. It is shown that the Cartesian product file is only a special case of the proposed file system.<>