Abstract: Methods, systems, and computer program products for monitoring collaboration between members of a group and providing feedback are described. A count of group members m of a group G, a count of group items i, and a characteristic of an action a performed by a member m on an item i, where a?A, m?M, and i?I, are obtained. A member-item score is computed for a time quantum Tq, where the time quantum Tq is a fixed-length amount of time with an arbitrary start point. A collaboration score QG for the group G is computed, where QG=??m?m ??i?IQm,i.

Abstract: Methods, systems, and computer program products for monitoring collaboration between members of a group and providing feedback are described. A count of group members m of a group G, a count of group items i, and a characteristic of an action a performed by a member m on an item i, where a ? A, M ? M, and i ? I, are obtained. A member-item score is computed for a time quantum Tq, where the time quantum Tq is a fixed-length amount of time with an arbitrary start point. A collaboration score QG for the group G is computed, where QG=??m?m ??i?I Qm,i.

Abstract: A method and a system are described that involve generating a graphical tree hierarchy of a data structure and its accompanying metadata. In one embodiment, the method includes building a graphical tree hierarchy with a plurality of levels, wherein the graphical tree hierarchy includes at least a root node, a plurality of non-leaf nodes, and a plurality of leaf nodes. Further, the method includes aggregating at least a portion of the plurality of non-leaf nodes at a level of the graphical tree hierarchy, if a subset of the plurality of non-leaf nodes residing at the level exceeds a maximum number of nodes per the level. The method also includes scaling down the plurality of leaf nodes, if the plurality of levels of the graphical tree hierarchy exceeds a maximum number of levels.

Abstract: A method and a system are described that involve generating a graphical tree hierarchy of a data structure and its accompanying metadata. In one embodiment, the method includes building a graphical tree hierarchy with a plurality of levels, wherein the graphical tree hierarchy includes at least a root node, a plurality of non-leaf nodes, and a plurality of leaf nodes. Further, the method includes aggregating at least a portion of the plurality of non-leaf nodes at a level of the graphical tree hierarchy, if a subset of the plurality of non-leaf nodes residing at the level exceeds a maximum number of nodes per the level. The method also includes scaling down the plurality of leaf nodes, if the plurality of levels of the graphical tree hierarchy exceeds a maximum number of levels.