proxy.golang.org : github.com/ekzhu/go-sql-lsh
Package sqllsh provides an on-disk alternative to in-memory LSH index, using relational databases. This package does not implement any specific locality-sensitive hash function family (e.g. MinHash, Random Hyperplane Projection, p-Stable Distribution Projection, etc.). It lets you store the hash values with the k and l parameters. where k is the number of hash values that form one hash key, and l is the number of hash tables that uses the hash keys. For detail of the algorithm one can read this book chapter: http://infolab.stanford.edu/~ullman/mmds/ch3.pdf Inside a relational database, an LSH index is a table, each Signature is a row, and each locality-sensitive hash function's hash values form a column. During query, collisons of hash keys are checked using AND and OR. A B-Tree multi-column index can be built for each hash key to improve query performance.
Registry
-
Source
- Documentation
- JSON
purl: pkg:golang/github.com/ekzhu/go-sql-lsh
License: MIT
Latest release: almost 9 years ago
First release: almost 9 years ago
Namespace: github.com/ekzhu
Stars: 25 on GitHub
Forks: 4 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: 29 days ago