That in many cases, I can gain efficiency if I'm willing to give up space. Having said that though, there may still be a problem, or there ought to be a problem that may be bugging you slightly, which is how do I guarantee that my hash function takes any input into exactly one spot in the storage space?
普遍存在的增益和权衡,在许多的例子中,可以通过牺牲空间而得到效率方面的增加,话说回来,仍然存在一个问题,或者应该会有一个问题困扰着你,就是我如何保证我的哈希函数能够准确将,任一输入映射到相应的唯一的存贮空间中去?
I may not want to do the full range of this, but I may decide I have to use a lot of gigabytes of space in order to do a trade off.
哈希成一个整数,我不想完整的去做这件事,但是我可以想像我需要用许多G的空间,去完成空间和时间之间的权衡。
应用推荐