Paper Info
Title
Minuet: a scalable distributed multiversion B-tree
Abstract
Data management systems have traditionally been designed to support either long-running analytics queries or short-lived transactions, but an increasing number of applications need both. For example, online games, socio-mobile apps, and e-commerce sites need to not only maintain operational state, but also analyze that data quickly to make predictions and recommendations that improve user experience. In this paper, we present Minuet, a distributed, main-memory B-tree that supports both transactions and copy-on-write snapshots for in-situ analytics. Minuet uses main-memory storage to enable low-latency transactional operations as well as analytics queries without compromising transaction performance. In addition to supporting read-only analytics queries on snapshots, Minuet supports writable clones, so that users can create branching versions of the data. This feature can be quite useful, e.g. to support complex "what-if" analysis or to facilitate wide-area replication. Our experiments show that Minuet outperforms a commercial main-memory database in many ways. It scales to hundreds of cores and TBs of memory, and can process hundreds of thousands of B-tree operations per second while executing long-running scans.
Year
DOI
Venue
2012
10.14778/2311906.2311915
PVLDB
Keywords
DocType
Volume
main-memory b-tree,data management system,commercial main-memory database,read-only analytics query,long-running analytics query,analytics query,multiversion b-tree,main-memory storage,b-tree operation,long-running scan,in-situ analytics
Journal
5
Issue
ISSN
Citations 
9
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 9, pp. 884-895 (2012)
13
PageRank 
References 
Authors
0.64
32
3
Name
Order
Citations
PageRank
Benjamin Sowell11098.08
Wojciech Golab221017.22
Mehul A. Shah33547317.66