The most advanced Merkle tree library for Rust
-
Updated
Aug 12, 2024 - Rust
The most advanced Merkle tree library for Rust
Generic, minimalist, parallelizable Merkle tree
Hash tree enabling efficient comparisons
Simple keyed tree data structure 🔑🌲
This is an implementation of Apriori algorithm for frequent itemset generation and association rule generation. The GUI is made using JAVA FX or Cmd_Line version can be used
Merkle Tree and Lamport Signature Python Implementation (master's degree short project)
EinsteinDB is a Hybrid memory system consisting of DRAM and Non-Volatile Memory configured to persist data fast.
Parallelised Data Backup Using Hash (Merkle) Trees
Basic implementation of merkle tree in python
Bachelor thesis on Merkle Trees at Royal Institute of Technology KTH
The assignments of MSBD course ----- DM(Data Mining)
Apriori algorithm using hash tree
Prototype implementation of Leighton-Micali Signature system
Implementation of Apriori Algorithm using hash tree data structure in C
Gem for managing key trees / nested hashes
Hash tree implementation in C to generate frequent itemsets and association rules using apriori algorithm
Some common simple data mining algorithm
A general-purpose hash trees support for Microsoft SQL Server databases (deployed as a single T-SQL script)
An interview test project from 2019. Company: Guardtime. Country: Estonia. Result: Failed.
Add a description, image, and links to the hash-trees topic page so that developers can more easily learn about it.
To associate your repository with the hash-trees topic, visit your repo's landing page and select "manage topics."