sentence1: our data structure is a trie in which individual nodes are represented by b-trees , which are searched in parallel ( section 3 ) and arranged compactly in memory ( section 4 ) .
sentence2: the data structure is a list which is mainly accessed wittl a typical lifo stack policy .