Top 8 Java Hashing Projects
-
sirix
SirixDB is an an embeddable, bitemporal, append-only database system and event store, storing immutable lightweight snapshots. It keeps the full history of each resource. Every commit stores a space-efficient snapshot through structural sharing. It is log-structured and never overwrites data. SirixDB uses a novel page-level versioning approach.
-
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
password4j
Java cryptographic library that supports Argon2, bcrypt, scrypt and PBKDF2 aimed to protect passwords in databases. Easy to use by design, highly customizable, secure and portable. All the implementations follow the standards and have been reviewed to perform better in the JVM.
-
hash-checker
Fast and simple application that allows you to generate and compare hashes from files and text
-
data-structures-and-algorithms-in-java
Data Structures and Algorithms in Java ( DSA ) (by Deepali-Srivastava)
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
We're using a similar trie structure as the main document (node) index in SirixDB[1]. Lately, I got some inspiration for different page-sizes based on the ART and HAMT basically for the rightmost inner pages (as the node-IDs are generated by a simple sequence generator and thus also all inner pages (we call them IndirectPage) except for the rightmost are fully occupied (the tree height is adapted dynamically depending on the size of the stored data. Currently, always 1024 references are stored to indirect child pages, but I'll experiment with smaller sized, as the inner nodes are simply copied for each new revision, whereas the leaf pages storing the actual data are versioned themselfes with a novel sliding snapshot algorithm.
You can simply compute from a unique nodeId each data is assigned (64bit) the page and reference to traverse on each level in the trie through some bit shifting.
[1] https://github.com/sirixdb/sirix
Java Hashing related posts
Index
What are some of the best open-source Hashing projects in Java? This list will help you:
| Project | Stars | |
|---|---|---|
| 1 | sirix | 1,079 |
| 2 | Zero-Allocation-Hashing | 765 |
| 3 | password4j | 328 |
| 4 | argon2-jvm | 327 |
| 5 | hash-checker | 158 |
| 6 | data-structures-and-algorithms-in-java | 56 |
| 7 | DeadHash-android | 29 |
| 8 | Java-DSA | 14 |
Sponsored