performance - Using hashes as IDs in key-value stores -


i'm wondering whether idea use hashes (cityhash, murmur , like) keys in key-value store hazelcast. i'm expecting have 2,000,000,000 records (urls) in database, collisions happen. wouldn't super critical lose data through hash collisions, of course best avoid them.

a record contains url, time stamp, status code. main operations inserting , looking whether url exists.

so, suggest, given speed relevant:

  • using id generator, or
  • using hash algorithm cityhash or murmur, or
  • using relevant string, url in case, itself?

hazelcast not rely on hashcode/equals methods of key object, instead using murmur hash of binary representation of key.

in short, should not worry hash collisions.


Comments

Popular posts from this blog

javascript - gulp-nodemon - nodejs restart after file change - Error: listen EADDRINUSE events.js:85 -

Fatal Python error: Py_Initialize: unable to load the file system codec. ImportError: No module named 'encodings' -

javascript - oscilloscope of speaker input stops rendering after a few seconds -