Workday, Inc.

Darren Kermit Lee

Francis Wang

Ngoc Nguyen

Christof Bornhoevd

Shuyuan Chen

Ritu Jain

Srinivas Vemuri

Ilan Cohen

Mythili Gopalakrishnan

Huned Botee

Peter Long

Tim Berston

Adam Smith

Crichton McCutcheon

Mark Thompson

Techniques for providing horizontally scaled caching of versioned data are provided. In some aspects, the techniques described herein relate to a method including initializing a first version cache (VC) object based on a version of data stored in a data storage device; replicating the first VC to generate a second VC; receiving a write operation at the first VC; generating a delta for the write operation, the delta representing a change in the version of data; writing the delta to a persistent replication log, the persistent replication log storing an ordered set of deltas including the delta; writing data in the write operation to the data storage device; and applying the ordered set of deltas at the second VC to update data stored by the second VC.

Horizontal scaling of version caches in a distributed high-concurrency multi-user environment

A system, method, and device for updating a base version of a hypercube are provided. The method includes (i) obtaining a request for a planning session with respect to a hypercube; and (ii) in response to obtaining the request: (a) determining that the planning session uses a base version of the hypercube, (b) receiving a value input to update a particular location in the hypercube, (c) storing the value for the particular location in the base version of the hypercube, and (d) propagating an update to the particular location of the base version of the hypercube to one or more scenario versions having a dependency on the base version.

What if scenario planning—updating a base plan version

A system for updating a hypercube includes an interface and a processor. The interface is configured to receive an indication to update a cell of the hypercube. The processor is configured to determine a primary dimension value associated with the cell; determine a group of dependencies based at least in part on the primary dimension value, wherein a dependency of the group of dependencies comprises one or more primary dimension values and a pattern; for the dependency of the group of dependencies, determine a set of source locations based at least in part on the one or more primary dimension values and the pattern; and mark the set of source locations as invalid.

Systems and methods for improving computational speed of planning by tracking dependencies in hypercubes

A system, method, and device for indexing to a hypercube is provided. The method includes (i) obtaining an index that maps dimensional values to a collection of locations within a hypercube, (ii) determining that one or more tuples of the hypercube is updated along a particular dimension, and (iii) in response to determining that the one or more tuples of hypercube is updated along a particular dimension, creating a new virtual tuple for each updated row and updating the index to store a pointer to the new virtual tuple for a new particular dimension value, the virtual tuple comprising a pointer to a tuple in the index and a validity period for the tuple.

Memory efficient multi-versioned concurrency for a hypercube memory cache using virtual tuples

A system, method, and device for managing updates to a hypercube is provided. The method includes (i) obtaining a hypercube comprising a plurality of locations, wherein a particular location has an anchor object that stores version information for the particular location, and the particular location comprises a first formula that is evaluated to return a value for the particular location, (ii) in response to receiving the request for the value, determining that the particular location comprises the first formula, (iii) in response to determining that the particular location comprises the first formula, evaluating the first formula to obtain a result, and (iv) storing the result for the particular location in association with the version information for the particular location.

Memory efficient multi-versioned concurrency for a hypercube memory cache using formula snapshots

Systems and methods for precomputing data and storing cache objects corresponding to the precomputed data are described. A system creates a new cache object when a user interacts with the system. The system precomputes formulas in the newly created cache object by replacing the formulas with corresponding calculated values. The system precomputes the formulas in the background (i.e., the user is not presented with the precomputed values while the user is manipulating the data). The system may persistently store a precomputed version cache object in a dedicated version cache storage for later use. If updates are performed to the structure and/or values of a version represented in a precomputed version cache object, effected parts of the version cache object are invalidated by replacing calculated values with the underlying formulas.

Systems and methods for accelerating data computation

A system for visual modification of data. The system comprising, an interface layer for displaying data and for receiving one or more visual inputs for modifying data; a data layer for storing data; and an analysis engine layer for connecting the interface layer and the data layer, wherein the analysis engine layer is configured to receive the one or more visual inputs from the graphical interface for modifying the graphical representation; modify the underlying data based on the visual inputs; modify a derived data based on the modified underlying data; and transfer the modified derived data to the interface layer for display.

Methods and systems for visual data manipulation

A system for caching includes an interface to receive a portion of a hypercube to evaluate. The hypercube includes cells with a set of the cells having a formula. The system includes a processor to determine term(s) in the formula for each cell of the set of cells; remove from consideration a time dimension and/or a primary dimension for the term(s) in the formula for each cell of the set of cells; determine a set of distinct terms using the term(s); determine whether a total number of terms in the set of cells is larger than a number of distinct terms in the set of distinct terms; and in response to determining that the total number of terms in the set of cells is larger than the number of distinct terms in the set of distinct terms, indicate to cache the set of distinct terms during evaluation.

Growing community of inventors

Sunnyvale, CA, United States of America

Darren Kermit Lee