{"title":"通过散列来分配键","authors":"H. H. von Brand","doi":"10.1109/SCCC.2002.1173167","DOIUrl":null,"url":null,"abstract":"The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function front keys to buckets would give. This model gives surprisingly simple expressions for the mean value of some statistics on hash functions. It is also seen that the universal hash functions give the same distribution of keys, and so the results here are applicable to them too.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the distribution of keys by hashing\",\"authors\":\"H. H. von Brand\",\"doi\":\"10.1109/SCCC.2002.1173167\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function front keys to buckets would give. This model gives surprisingly simple expressions for the mean value of some statistics on hash functions. It is also seen that the universal hash functions give the same distribution of keys, and so the results here are applicable to them too.\",\"PeriodicalId\":130951,\"journal\":{\"name\":\"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCC.2002.1173167\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2002.1173167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function front keys to buckets would give. This model gives surprisingly simple expressions for the mean value of some statistics on hash functions. It is also seen that the universal hash functions give the same distribution of keys, and so the results here are applicable to them too.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
