{"title":"对一些大文件目录结构的性能研究","authors":"J.B. Grimson, G.M. Stacey","doi":"10.1016/0020-0271(74)90042-4","DOIUrl":null,"url":null,"abstract":"<div><p>Two different directory structuring techniques—division hash technique and a hybrid technique—are compared for the same set of keys with directories of from 10,000 to 100,000 unique keys. Retrieval costs, in terms of the number of accesses to secondary storage required to retrieve the keys, are considered in detail.</p></div>","PeriodicalId":100670,"journal":{"name":"Information Storage and Retrieval","volume":"10 11","pages":"Pages 357-364"},"PeriodicalIF":0.0000,"publicationDate":"1974-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0020-0271(74)90042-4","citationCount":"1","resultStr":"{\"title\":\"A performance study of some directory structures for large files\",\"authors\":\"J.B. Grimson, G.M. Stacey\",\"doi\":\"10.1016/0020-0271(74)90042-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Two different directory structuring techniques—division hash technique and a hybrid technique—are compared for the same set of keys with directories of from 10,000 to 100,000 unique keys. Retrieval costs, in terms of the number of accesses to secondary storage required to retrieve the keys, are considered in detail.</p></div>\",\"PeriodicalId\":100670,\"journal\":{\"name\":\"Information Storage and Retrieval\",\"volume\":\"10 11\",\"pages\":\"Pages 357-364\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1974-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0020-0271(74)90042-4\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Storage and Retrieval\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0020027174900424\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Storage and Retrieval","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0020027174900424","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A performance study of some directory structures for large files
Two different directory structuring techniques—division hash technique and a hybrid technique—are compared for the same set of keys with directories of from 10,000 to 100,000 unique keys. Retrieval costs, in terms of the number of accesses to secondary storage required to retrieve the keys, are considered in detail.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
