I agree. I'm particularly interested in the full text search module. A lot of libraries that manipulate data structures in Redis could benefit from being able to modify data as a Redis module.
What does 'DMA method' mean here?
So basically you can model data structures on top of this, provided that there is an easy way to convert offsets to pointers, or that your structs are scalar only.
In the case of the inverted index, it uses delta and varint encoding of the index records, so no real mapping to structs was needed, I just traverse the data and deserialize each entry on the fly in a pretty fast manner.
Another example was the use of this for bloom filters, that directly manipulate bits on the key.