-
I have a simple/naive thought re reverse-hashing the kmers. We can provide an option to Minhash `reversible = True` to use a reversible hashing function like the Integer Hashing to retrieve back canon…
-
In StringZilla a 64-bit rolling hash function is reused for both string hashes and substring hashes, Rabin-style fingerprints. Rolling hashes take the same amount of time to compute hashes with differ…
-
Hi team,
I found that if we join the same local table multiple times, the read row multiplies.
I'm just wondering if there is any way to optimize this behavior? Since the same table is used mult…
-
Currently, our hash function is quite naive, and it's very easy to cause very bad collisions in the hash index.
We should replace it. DuckDB seems to be using a very simple but efficient hash funct…
-
Do you plan on implementing more hash functions? My use case is for a temporal data store, which stores XML or JSON representations in a tree structure (and eventually in a custom binary format on dis…
-
Hello! [The Perkeep project](https://perkeep.org/) seeks to build a content-addressable store for every conceivable type of data. It uses the technique of hashsplitting large byte streams via rolling …
-
Cloned from Pagure issue: https://pagure.io/389-ds-base/issue/48876
- Created at 2016-06-09 06:24:08 by [firstyear](https://pagure.io/user/firstyear) (@Firstyear)
- Assigned to [firstyear](https://pag…
-
I've been wanting something like a "commutative cryptographic hash function" (or just a "rolling cryptographic hash function") that would allow us to compute a cryptographic hash of some data `M` give…
-
## Bug report
**Required Info:**
- Operating System:
- Ubuntu 20.04
- Installation type:
- binaries
- Version or commit hash:
- rolling
- DDS implementation:
- default
- Client l…
-
The `BuzHash` and `BuzHashBuf` structs need to be clearly marked in the documentation as not yet working. There is no hash function yet, as far as I can tell.
I almost tried to use this thing in a …