Efficiently store large list structure in RocksDB so that the data can be retrieved in pages
you need to split your "large list" into a set of nodes of a "Segment B-Tree" and then store each node one as a RocksDB record.

Each node will need to store it's Height in the "Segment B-Tree" and it's left child ID.

This have a number of benefit 


This will let you find if one entry is inside the list without
    having to scan the whole list.
Scanning all the leaf node would be fast because leaf node have
contiguous ID
This let you easily fetch any subset of the list using offset.


See : https://www.sqlite.org/fts3.html for more detail.