Workiva Inc.

MacLeod Gordon Broad

Travis Smith

Dustin Lee Hiatt

Matthew Peter Hinrichsen

Graham I Cummins

Mark David Erickson

Robert Ray Lamb

Joel Patrick Barbour

Tanner Davis Miller

Joseph Strach

Mark Shaule

A system for maintaining links and revisions for documents is described. The system comprises a productivity server configured to provide a document collaboration service and having processors and a memory storing program data. The program data configures the processors to: receive requests indicating revisions on the documents, including a first request that indicates a first revision to a first document, and a second request that indicates a second revision to a second document. For each request, a workspace revision counter shared by, and indicating a revision state of, the documents is incremented. The workspace revision counter is incremented a first time for the first request and a second time for the second request. Revisions corresponding to the each request are queued in a workspace revision queue shared by the documents. The revisions are caused to be performed on the documents that correspond to the each request.

System and method for maintaining links and revisions

A method for maintaining links and revisions for a plurality of documents is described. The method is carried out by one or more computing devices. Requests that indicate revisions to be carried out on the plurality of documents are received, at least one of the requests corresponding to revisions for different documents of the plurality of documents. For each request: a workspace revision counter that is shared by the plurality of documents is incremented, the workspace revision counter indicating a revision state of the plurality of documents, the revision is queued in a workspace revision queue that is shared by the plurality of documents, and the revision indicated by the request is caused to be performed on one or more documents of the plurality of documents that correspond to the request.

A method for traversing a node tree, having a root node and a hierarchy of child nodes, to a selected child node is described. A node identifier of the root node is determined by performing a hash function with at least a seed value for the node tree. Each child node of the hierarchy has a respective node identifier determined by performing the hash function with i) the seed value, ii) a node identifier of a parent node of the child node, and iii) a child index of the parent node. The selected child node's node identifier is determined by performing the hash function with i) the seed value, ii) the node identifier of the selected child node's parent node, and iii) the child index of the parent node for the selected child node. A retrieval of data stored at a location indicated by the node identifier of the selected child node is caused.

Distributed processing using a node hierarchy

Growing community of inventors

Sault Ste. Marie, Canada

MacLeod Gordon Broad