IO-Algorithms.pptVIP

I/O-Algorithms;I/O-Model;Fundamental Bounds;B-tree;Secondary Structures;Weight-balanced B-tree;Weight-balanced B-tree;Persistent B-tree;Persistent B-tree;B-tree Construction;Main idea: Logically group nodes together and add buffers Insertions done in a “lazy” way – elements inserted in buffers. When a buffer runs full elements are pushed one level down. Buffer-emptying in O(M/B) I/Os ? every block touched constant number of times on each level ? inserting N elements (N/B blocks) costs I/Os.;Definition: B-tree with branching parameter and leaf parameter B Size M buffer in each internal node Updates: Add time-stamp to insert/delete element Collect B elements in memory before inserting in root buffer Perform buffer-emptying when buffer runs full;Basic Buffer-tree;Basic Buffer-tree;Basic Buffer-tree;Basic Buffer-tree;Basic Buffer-tree;Basic Buffer-tree;Batching of operations on B-tree using M-sized buffers I/O updates amortized All buffers emptied in I/Os One-dim. rangesearch operations can also be supported in I/Os amortized Search elements handle lazily like updates All elements in relevant sub-trees reported during buffer-emptying Buffer-emptying in O(X/B+T’/B), where T’ is reported elements Using buffer technique persistent B-tree built in I/O ;Basic buffer tree can be used in external priority queue To delete minimal element: Empty all buffers on leftmost path Delete elements in leftmost leaf and keep in memory Deletion of next M minimal elements free Inserted elements checked against minimal elements in memory I/Os every O(M) delete ? amortized;Other External Priority Queues;Other Buffer-tree Technique Results;Summary/Conclusions: Fund. Data Structures;References;Flow Accumulation;Computing Flow Accumulation;Flow Accumulation;I/O-Efficient Flow Accumulation