-
I've been playing around with various succinct algorithms recently and when I saw this project on Twitter my immediate thought was "oh, let's see how it compares with Elias-Fano". In case you (or anot…
-
One idea is run-length encoding offsets https://github.com/tinygraph/tinygraph/issues/12 - which will probably work quite well with very sparse graphs like road networks.
Another idea is Elias-Fano…
-
We should look into implementing rank/select structures for bitset / elias-fano https://github.com/tinygraph/tinygraph/issues/13
For example have a look at
> "Space-efficient, high-performance…
-
Recently Elias Fano has become more popular to represent posting lists in search engine.
In order to intersect two positng lists efficiently, it is then required to have an efficient implementation…
-
This ticket enhances the currently implemented Huffman module by generalizing it to a q-nary Huffman and implementing a faster decoding method. In addition, some parts of it were rewritten and moved…
-
**Describe the solution you'd like**
The bitfunnel paper contained some additions to the `partitioned_elias_fano` codebase which allowed measuring queries per second with multiple threads. see here: …
-
nice library. I remember the original `ot` code has compact_elias_fano codes where universe and num elems can be passed in during serialization to make the format more compact. this is especially impo…
-
We are storing two arrays in our csr graph format
1. offsets into the targets array
2. targets array with target vertices
The offsets we we want to run-length or elias-fano encode, see
- https:/…
-
We are storing two arrays in our csr graph format
1. offsets into the targets array
2. targets array with target vertices
for example for the edges
```
(0 -> 1)
(0 -> 2)
(1 -> 0)
(1 -> 2)
…
-
This issue tracks how we configure / intend to configure the mg4j index for maximum performance in the experiment.
1. [Not implemented] Disable positions.
2. Disable scoring.
3. [Not verified]. U…