Abstract: Apparatuses and methods are provided and applied to graphically represent the history of changes to a datastore maintaining a plurality of datastore records, each datastore record of the plurality of datastore records comprising at least one sector, as a directed acyclic graph to facilitate making, undoing, and redoing independent changes without regard to any explicit branching structure. Current records store content, a log directed acyclic graph relates various changes, and a current change record mapping relates each sector of each datastore record to a respective current change record. Changes by users requiring moderation are independently overlayed upon changes visible to additional users, with changes being approved and conflicting changes being resolved by administrating users.

Abstract: A method is provided for graphically representing the history of changes to a database maintaining a plurality of database records, each database record of the plurality of database records comprising at least one sector, as a directed acyclic graph to facilitate making, undoing, and redoing independent changes without regard to any explicit branching structure. Current records store content, a log directed acyclic graph relates various changes, and a current change record mapping relates each sector of each database record to a respective current change record. Changes by users requiring moderation are independently overlayed upon changes visible to additional users, with changes being approved and conflicting changes being resolved by administrating users.

Abstract: A method is provided for graphically representing a portion of a directed acyclic graph as a hierarchical tree structure to facilitate user collaboration over a network, the method comprising obtaining a collaborative project shared among a plurality of users over a communication network, the project represented by a directed acyclic graph structure comprising a plurality of entities and a plurality of associations, the plurality of entities including one or more locus entities, each of the locus entities associated with a locus node from which ancestor entities in the directed acyclic graph of each locus entity are traversed as an inverted tree structure, each child node in the inverted tree indicating a respective entity related as a parent in the directed acyclic graph to the entity of its parent in the inverted tree; and expanding a subtree rooted at a leaf node of the inverted tree in response to user input.

Abstract: A method is provided for graphically representing a portion of a directed acyclic graph as a hierarchical tree structure to facilitate user collaboration over a network, the method comprising obtaining a collaborative project shared among a plurality of users over a communication network, the project represented by a directed acyclic graph structure comprising a plurality of entities and a plurality of associations, the plurality of entities including one or more locus entities, each of the locus entities associated with a locus node from which ancestor entities in the directed acyclic graph of each locus entity are traversed as an inverted tree structure, each child node in the inverted tree indicating a respective entity related as a parent in the directed acyclic graph to the entity of its parent in the inverted tree; and expanding a subtree rooted at a leaf node of the inverted tree in response to user input.