Flat vector representation of sparse multivariate polynomials is introduced in the computer algebra system TRIP with specific
care to the cache memory. Burst tries are considered as an intermediate storage during the sparse multivariate polynomial
multiplication by paying attention to the memory allocations. Timing and memory consumption are examined and compared with
other recursive representations and other computer algebra systems.