Bursting

###Bursting algorithm

• A new access trie node b is created. Each pointer is set to an empty container.

• For each record r in the original container, which has string cr k+1 ···crn ,

  (a) The leading character cr k+1 is removed from the string, and (b) The record is added to the container indicated by the cr k+1 th pointer of b, using the string cr k+2 ··· crn . If the record was the empty string, it is added under b’s empty-string pointer.

• The original container is discarded.