Hello all :-)
I would like to publish a paper on my work around Generic Tuple Store (nstore) built on top of WiredTiger and portable to other Ordered Key-Value Store (OKVS).
Is there any paper that you can recommend me to read that shed lights on general principles behind OKVS and WiredTiger in particular.
I am looking to find answers to the following questions:
- Are keys cached in memory? What about values?
- What is the space and time complexity to insert a record?
- What is the space and time complexity to retrieve a record?
Thanks in advance,