Ch4.6 B+ Tree Inverted File Index英文教学课件.pptVIP

§6B+Trees  【Definition】AB+treeoforderMisatreewiththefollowingstructuralproperties: (1)Therootiseitheraleaforhasbetween2andMchildren. (2)Allnonleafnodes(excepttheroot)havebetweenM/2andMchildren. (3)Allleavesareatthesamedepth. AssumeeachnonrootleafalsohasbetweenM/2andMchildren.  AB+treeoforder4 (2-3-4tree)  Alltheactualdataarestoredattheleaves.  EachinteriornodecontainsMpointerstothechildren.  AndM1smallestkeyvaluesinthesubtreesexceptthe1stone.  1/11  §6 B+ Trees A B+ tree of order 3 (2-3 tree)  Find: 52  Insert: 18 16,17,18  Insert: 1   Insert: 19   Insert: 28 2/11 §6 B+ Trees  Insert: 70 First find a sibling with 2 keys and adjust. Keep more nodes full.  Deletion is similar to insertion except that the root is removed when it loses two children. 3/11 §6 B-Trees For a general B-tree of order M Btree Insert ( ElementType X, Btree T ) { Search from root to leaf for X and find the proper leaf node; Insert X; while ( this node has M+1 keys ) { split it into 2 nodes with (M+1)/2 and (M+1)/2  keys, respectively; if (this node is the root) create a new root with two children; check its parent; } } Depth(M, N) = O( logM/2 N  ) T = O(M) T(M, N) = O( (M/log M) log N ) TFind (M, N) = O( log N ) Note: The best choice of M is 3 or 4. Home work: p.138 4.36 Access a 2-3 tree 4/11 Inverted File Index How can I find in which retrieved web pages that include Computer Science? 5/11 Inverted File Index  Solution 1: Scan each page for the string Computer Science. How did Google do? 6/11 Inverted File Index  Solution 2: Inverted File Index 【Definition】 Index is a mechanism for locating a given term in a text. 【Definition】 Inverted file contains a list of pointers (e.g. the number of a page) to all occurrences of that term in the text. 〖Example〗 Document sets Doc Text 1 Gold silver truck 2 Shipment of gold damaged in a fire 3 Delivery of silver arrived in a silver truck 4 Shipment of gold arrived in a truck