The Log-Structured Merge-Tree (LSM-Tree)

  • Needs a date

  • Needs a location

  • Abstract: ... The Log-Structured Merge-tree (LSM-tree) is a disk-based data structure designed to provide low-cost indexing for a file experiencing a high rate of record inserts (and deletes) over an extended period. The LSM-tree uses an algorithm that defers and batches index changes, cas- cading the changes from a memory-based component through one or more disk components in an efficient manner reminiscent of merge sort. During this process all index values are contin- uously accessible to retrievals (aside from very short locking periods), either through the memory component or one of the disk components. The algorithm has greatly reduced disk arm movements compared to a traditional access methods such as B-trees, and will improve cost- performance in domains where disk arm costs for inserts with traditional access methods overwhelm storage media costs. ...

    http://www.cs.umb.edu...

Join or login to comment.

Want to go?

Join and RSVP

2 going

  • Doug T.

    ...

  • Jorge O.

    Server engineer at foursquare, programming language junkie, Scala enthusiast, still recovering... more

People in this
Meetup are also in:

Create a Meetup Group and meet new people

Get started Learn more
Allison

Meetup has allowed me to meet people I wouldn't have met naturally - they're totally different than me.

Allison, started Women's Adventure Travel

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy