B-tree indexes for high update rates Export

@article{citeulike:4234826, abstract = {In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering using automated sensors often exhibits this imbalance. More generally, indexing streams is considered an unsolved problem.For those applications, B-tree indexes are good choices if some trade-off decisions are tilted towards optimization of updates rather than towards optimization of queries. This paper surveys some techniques that let B-trees sustain very high update rates, up to multiple orders of magnitude higher than traditional B-trees, at the expense of query processing performance. Not surprisingly, some of these techniques are reminiscent of those employed during index creation, index rebuild, etc., while other techniques are derived from well known technologies such as differential files and log-structured file systems.}, address = {New York, NY, USA}, author = {Graefe, Goetz}, citeulike-article-id = {4234826}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1122002}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1121995.1122002}, doi = {10.1145/1121995.1122002}, issn = {0163-5808}, journal = {SIGMOD Rec.}, keywords = {b-tree, ncq, survey, update, write-optimized}, number = {1}, pages = {39--44}, posted-at = {2009-06-20 11:43:29}, priority = {0}, publisher = {ACM}, title = {B-tree indexes for high update rates}, url = {http://dx.doi.org/10.1145/1121995.1122002}, volume = {35}, year = {2006} }

TY - JOUR ID - citeulike:4234826 L3 - citeulike-article-id:4234826 N2 - In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering using automated sensors often exhibits this imbalance. More generally, indexing streams is considered an unsolved problem.For those applications, B-tree indexes are good choices if some trade-off decisions are tilted towards optimization of updates rather than towards optimization of queries. This paper surveys some techniques that let B-trees sustain very high update rates, up to multiple orders of magnitude higher than traditional B-trees, at the expense of query processing performance. Not surprisingly, some of these techniques are reminiscent of those employed during index creation, index rebuild, etc., while other techniques are derived from well known technologies such as differential files and log-structured file systems. IS - 1 JF - SIGMOD Rec. SN - 0163-5808 AD - New York, NY, USA EP - 44 TI - B-tree indexes for high update rates PB - ACM VL - 35 SP - 39 KW - b-tree KW - ncq KW - survey KW - update KW - write-optimized AU - Graefe, Goetz PY - 2006/// UR - http://dx.doi.org/10.1145/1121995.1122002 ER -