an efficient representation of a changing directed acyclic graph in a computer system . a representation of all the paths in the dag are stored in memory and kept synchronized with the representation of the dag which may change over time . this allows some important queries to be performed very quickly such as finding all the descendants of a node .