-
For some reason, when we early-return from this line (eg. because we ran out of disk in the temp dir):
https://github.com/vigna/webgraph-rs/blob/9cd05365def84b8f3bc2a61587c1a68a00ad818c/src/algo/ll…
-
@Tony-X and I were chatting about the difference in skipping in Tantivy (single level, fast binary search) and Lucene (multi-level, sort of complex implementation) and wondering whether that is causin…
-
While I cannot share the node embedding (for now) since I am gzipping it to upload it on internet archive, in the meantime I can share some visualizations on the TransE embedding made with the GraPE l…
-
I think we should at least try to do something simple, eg. deduplicate or apply simple LZ77 compression. For instance if you use enclosing html tags to give different weights to individual terms, ther…
-
- How big is .bt leaf at bor-mainnet Level0 storage.kv
- How much places in file it touches
- What if we increase/reduce M
-
```
INFO[07-22|10:57:31.931] P2P app=caplin peers=71
INFO[07-22|10:57:35.793] Node is still syncing... downloading past blocks app=caplin stage=DownloadHistorica…
-
I am very impressed by MONI. I have a few questions about its index.
1. I can see the prefix.idx file keeps the sequence names among other things. What does prefix.plain.slp keep? Does it keep RL-B…
-
-
We can build a quasi-succinct index with / on top of Elias-Fano https://github.com/tinygraph/tinygraph/issues/13
which gives us rank/select https://github.com/tinygraph/tinygraph/issues/14 on top o…
-
In [Practical Entropy-Compressed Rank/Select Dictionary](https://arxiv.org/abs/cs/0610001) they provide a O(1) select technique without requiring a rank data structure.
This might be interesting fo…