Please use this identifier to cite or link to this item:
Title: Unele aspecte ale arborilor de tip B
Authors: Gorea, Adela
Keywords: tree
data structures
tree structures
binary search
binary trees
Issue Date: 2014
Publisher: USARB
Citation: Gorea, Adela. Unele aspecte ale arborilor de tip B / Adela Gorea // Tradiţie şi inovare în cercetarea ştiinţifică, Ediţia a 3-a : Materialele Colloquia Professorum, 12 oct. 2012. - Bălţi. - 2014. – P. 228-231.
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.
Appears in Collections:Articole

Files in This Item:
File Description SizeFormat 
228-231 Gore.PDF,25 kBAdobe PDFThumbnail

This item is licensed under a Creative Commons License Creative Commons