Talk:Log-structured merge-tree

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

???

This article has not yet received a rating on Wikipedia's content assessment scale.

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

The page says "LSM trees are used in database management systems such as BigTable, HBase, LevelDB, MongoDB, SQLite4, RocksDB, WiredTiger, Apache Cassandra, and InfluxDB." – None of these is a database management system. They are key/value stores at best. I wouldn't be aware of any database management system that actually uses LSM trees. — Preceding unsigned comment added by 2003:88:CF47:D345:25A4:3700:57D0:1F7A (talk) 15:59, 30 October 2016 (UTC)[reply]

Although some of these systems are not RDMSs, to say that they are "key/value stores at best" is idiotic and chauvinistic. (What are they at worst?) --Ori Livneh (talk) 02:13, 4 April 2017 (UTC)[reply]

Praxis and Reflection on LSM-Tree

Hi Ori Livneh,

We are working on a survey and reflection paper of the LSM-Tree after 25 years of its introduction. We are reviewing the various implementations and interacting with the corresponding engineers that applied this algorithm in their systems including Google, Facebook, Oracle, RocksDB and others. We like the clear and down-to-earth discussion you made on the Wiki article and wonder if we can send you a few questions and learn from your insights. Thank you in advance for your help.

Edward --Edwardgem (talk) 01:37, 31 March 2017 (UTC)[reply]

Hi Edward. Although I did start this article, the majority of the content was contributed by other editors. And, to be frank, my understanding of its subject matter is pretty shallow. I'd be happy to try and answer any questions you may have, but I'm probably not the best person to ask. If you go through the article history, you may be able to identify one or two contributors who have made more substantial contributions. Best of luck with your research. --Ori Livneh (talk) 02:05, 4 April 2017 (UTC)[reply]

Thank you for your reply. I have made contacts to the other contributors too. Wiki is great! Perhaps you can share with us your thoughts on the following:

- When you were looking at LSM, did you have a specific problem on hand that you think it will do the job? If so, can you please describe the issue? did you try and how did it work out?
- Looking back, is there a substitute structure you would consider over LSM? Why?

Thanks much.

Edwardgem (talk) 22:21, 14 April 2017 (UTC)[reply]