Assertion: tree's time | /r/CapableOf | exceed the time
Facets:
value: far
type: DEGREE
value: greatly
type: DEGREE
Source sentences:
text: B-trees have substantial advantages over alternative implementations when the time to access the data of a node greatly exceeds the time spent processing that data, because then the cost of accessing the node may be amortized over multiple operations within the node.
text: The time to read a record on a disk drive far exceeds the time needed to compare keys once the record is available.