-
For instance according to the papers:
HOT: A Height Optimized Trie Index for Main-Memory Database Systems
START — Self-Tuning Adaptive Radix Tree
-
We should either enhance our `PageReadOnlyTrx` and `PageTrx` interfaces to replace our trie structure for secondary indexes or simply store the ART in leaf pages of a wide branching IndirectPage and f…
-
people tend to non uninstall an app until its not taking up extra memory.
we should implement trie or suffix trees to squeeze the database.
-
At some point, I think the trie produced inclusion proofs which spelled out all other 15 nodes of the radix 16 tree layers, which waists like half the space in PoV blocks. We instead want Merkle root…
-
Inferring public properties from a class's constructor is not supported.
input :
```ts
export class TrieNode {
constructor(
public wordCount: number = 0,
public prefixCount: …
-
After playing around with this library, seems like the proof verifier may be incompatible with Ethereum merkle proofs generated thorough EIP-1186's eth_getProof method. Curious if I am missing somethi…
-
Would it be possible to extend your implementation with a function : Partial-Match Searching
F.i. pmsearch(root, 'a.a.a.' )
like in the DrDobbs Article from 1998?
Thanks in advise.
-
**Is your feature request related to a problem? Please describe.**
Prefix matching is needed in many places like:
1. Quickly decide which mount point a path is under
2. Sub-tree cutting while trave…
-
### What is wrong
We need an auditing strategy for state network.
Ideally, the strategy avoids some of the inherent complexity such as:
- lack of easy access to knowing what state data exists…
-
> I think we want to use sparse merkle trees
https://ethresear.ch/t/data-availability-proof-friendly-state-tree-transitions/1453/6
https://github.com/ethereum/research/blob/master/trie_research/bin…