Wednesday, September 25, 2013

[repost ]The Log-Structured Merge-Tree (LSM-Tree) (1996)

original:http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.2782 Abstract . High-performance transaction system applications typically insert rows in a History table to provide an activity trace; at the same time the transaction system generates log records for purposes of system recovery. Both types of generated information can benefit from efficient indexing. An example in a well-known setting is the TPC-A benchmark application, [...]



via WordPress http://blog.newitfarmer.com/software-develop/arithmetic/12876/repost-the-log-structured-merge-tree-lsm-tree-1996#utm_source=rss&utm_medium=rss&utm_campaign=repost-the-log-structured-merge-tree-lsm-tree-1996

Labels:

0 Comments:

Post a Comment

<< Home