Workiva Inc.

Dustin Lee Hiatt

Travis Smith

Dean Anthony Ritz

Graham I Cummins

Matthew Peter Hinrichsen

Mark David Erickson

Robert Ray Lamb

Tanner Davis Miller

Joel Patrick Barbour

MacLeod Gordon Broad

Alexander Campbell

John Pillar

Joshua Allen Beam

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.

In an embodiment, a data storage and retrieval system includes a computing device that configures the computer memory according to an RTree (a type of logic tree) representing a structure of a spreadsheet. The computer memory may be internal to or external to the computing device. In an embodiment, the RTree has a plurality of nodes, at least some of which contain one or more minimum bounding rectangles. Each minimum bounding rectangle ('MBR') encompasses cells of the spreadsheet from a different one of a plurality of columns of the spreadsheet, but does not encompass cells of any of the other columns of the plurality of columns. A node of the RTree may hold multiple MBRs or a single MBR.

Data storage and retrieval system and method for storing cell coordinates in a computer memory

The disclosure is generally directed to a method and computing device for maintaining dependencies among multiple reference elements (e.g., formulas of a table or spreadsheet). In various embodiments, prior to a reevaluation operation carried out on the reference elements, a computing device receives an input of a reference element via a user interface (e.g., receives a user's input of a formula), assigns the reference element to a group based on the dependency between the reference element and one or more other reference elements, and assigns the reference element to a location within a dependency graph to which the other reference elements are assigned. In response to an event that requires at least one of the reference elements to be reevaluated, the computing device reevaluates each group of reference elements in sequence a group at a time.

Method and computing device for maintaining dependencies among reference elements

Growing community of inventors

Charleston, SC, United States of America

Dustin Lee Hiatt