Log Structured Merge Trees
I am curious how an inverted index will be implemented efficiently atop an LSM tree. Maybe batch parts of the posting list under a numeric key  and when performing an intersection operation between two lists, you interate using a  range scan. Could work but i wonder how fast Read operations will be. Anybody attempted yet?