Abstract: An electronic information system which enables email based transactions comprises an information database storing information regarding a plurality of individuals in a group and selections available to individuals in the group. A first email message with a mailto hyperlink having a plurality of fields including actionable parameter is generated and sent. A reply email message is received in response to selection of the mailto hyperlink. The received email message includes the plurality of fields and the actionable parameter that indicates that a specific selection has been made. A processor performs the action indicated by the actionable parameter in response to the received email message, including updating the information database to indicate the specific selection that has been made.

Abstract: A system and method for 1) storing, in data stores, data associated with tenants in separated regions, each region corresponding to a tenant; 2) receiving a request from a first tenant to share data associated with the first tenant with other tenants; 3) storing, based on the request, access control data identifying data associated with the first tenant that is subject to sharing with the other tenants; 4) accessing model building data from the tenanted database system, the model building data defined at least in part by the access control data, wherein the model building data is associated with the first tenant and the other tenants; 5) creating a model based on the data associated with the first tenant and, if applicable, other data associated with the other tenants; and 6) providing access to the model to one or more other tenants.

Abstract: 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.

Abstract: A version of a software application is determined to be analyzed. The states of toggles associated with the version of the software application are analyzed to identify changed states of at least a portion of the toggles. A changed state of the changed states comprises a state of a toggle of the toggles that has changed during execution of the version of the software application. The changed state has a corresponding time frame and a corresponding sequence number. The changed states are logged.

Abstract: Structured access to volunteered private data disclosed. Access can be based on security and privacy constraint information (SPCI) that can be selected by the party volunteering the private data. The volunteered data can be stored in a protected portion of a public network. The SPCI can be correlated to the volunteered data. In response to receiving a request for access to the volunteered data, an attribute of the request can be determined to satisfy one or more rules related to the SPCI prior to facilitating access to a version of a portion of the volunteered data. The version of the portion of the volunteered data can be a redaction of the portion of the volunteered data. The version of the portion of the volunteered data can be aggregated with other portions of other volunteered data determined to satisfy corresponding SPCI related rules.

Abstract: The present application discloses a method, system, and computer system for processing queries to sparsely populated datasets. The method includes (i) receiving a query from a client system, (ii) determining, based at least in part on the query, a plurality of partitions of a hypercube that are expected to comprise information used in generating a response for the query, (iii) communicating a set of requests to a data source storing the hypercube, the set of requests comprising one or more requests corresponding to the plurality of partitions of the hypercube, (iv) obtaining, from the data source, a set of results to the set of requests, the set of results comprising data stored in the plurality of partitions of the hypercube, (v) determining a plurality of virtual objects for the set of results, (vi) combining the plurality of virtual objects into a response to the query, and (vii) providing, to the client system, the response to the query.

Abstract: An information management system may store information related to tasks to be performed by workers in an organization. Workers in the organization may communicate with the information management system using email messages. The information management system may not require a login or authentication procedure, and workers may interact with the information management system without the need to log in to the information management system. The information management system may receive an email message from a worker that indicates a request for a report. The information management system may determine whether to transmit the report to the worker based on whether the worker is appropriately registered with the information management system, and/or whether the worker has administrative privileges. The information management system, in response to a positive determination, may transmit the report to the email address from which the requesting email message was sent.

Abstract: The present application discloses a method, system, and computer system for dynamically managing or distributing models across a plurality of shards. The method includes determining that a first model is to be added to a first shard of a plurality of shards, the first shard being determined based at least in part on a predetermined cost function, adding the first model to the first shard, and restarting the first shard. The first model is associated with a first tenant. The first shard comprises at least one second model that is associated with a second tenant.

Abstract: 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.

Abstract: A system for shift design and assignment comprises an interface configured to receive scheduling input data which includes labor demand data, worker data, and scheduling configuration data, and a processor configured to generate a set of shift candidates, determine a set of decision variables, determine a cost function, determine a set of constraints, and determine simultaneously, using a SAT, a MP solver, or a MIP solver, a subset of the shift candidates selected in a final schedule and a set of shift assignments of which worker is assigned to which selected shift candidate of the subset of the shift candidates such that the hard constraints are fully respected, violations to the soft constraints are minimized, and the cost function is minimized.

Abstract: A system for data space limitation includes and interface and a processor. The interface is configured to receive a query for a structured data set. The processor is configured to determine an ordered list for calculations to respond to the query; perform the calculations according to the ordered list until an allowed time required for interactivity is reached; and in response to the allowed time being reached, provide results of the calculations.

Abstract: A system includes an interface and a processor. The interface is configured to receive a request to access shared services; provide a user interface for selecting a shared service of the shared services; and receive a selection of the shared service of the shared services. The processor is configured to determine data associated with the shared service of the shared services; store a shared-service tag indicating the data is associated with the shared service of the shared services and an identifier tag indicating the data is associated with a source; transfer the data to a model development system; determine a model using the data transferred to the model development system; and store the model.

Abstract: Disclosed are systems and methods for a materialized view matching framework that operates to improve the re-usability of materialized views within a database by, inter alia: i) enabling selection and aggregation of multiple materialized views; ii) generating and using validity filter predicates to exclude invalid data from materialized views; iii) generating and using change summaries to generate validity filter predicates; and iv) enabling on-demand transactional refresh operations. Such operations enable a more computational efficient and accurate usage of database data so as to provide more credible and desirable search results.

Abstract: The present application discloses a method, system, and computer system for managing data using keys. The method includes receiving a request to access data, wherein the data is encrypted based on a tenant service encryption key (TSEK) corresponding to the tenant database, determining a wrapper key used in connection with encrypting the TSEK based on a TSEK metadata, determining a top-level key used in connection with encrypting the wrapper key based on wrapper key metadata stored in association with the encrypted version of the wrapper key, obtaining the data stored within the tenant database, comprising decrypting at least part of the data based on (i) the TSEK, (ii) the wrapper key, and (iii) the top-level key, and providing the data in response to the request. The TSEK metadata is stored in the tenant database. An encrypted version of the wrapper key is stored in a key management service.

Abstract: A system for maintaining consistency of a data value using a probability includes an interface and a processor. The interface is configured to receive a data value for storing. The processor is configured to store the data value in a data element of a data structure and determine, using an adaptive filter, a probability of certainty associated with the data value. The adaptive filter receives a previously stored data value in a previously stored data element of a previously stored data structure as input to determine the probability of certainty associated with the data value. The adaptive filter provides as output the probability of certainty. The processor is further configured to store the probability of certainty associated with the data value in the data structure.

Abstract: A system includes one or more processors; and at least one non-transitory machine-readable storage media comprising instructions which, when executed by the one or more processors, cause the one or more processors to: generate a set of shift candidates based on labor demand data; determine a cost function including a labor cost, wherein the cost function is expressed at least in part in terms of a set of decision variables; determine a set of constraints based at least in part on the set of decision variables, worker data, and scheduling configuration data; and determine simultaneously, using a MIP solver, a subset of the shift candidates selected in a final schedule and a set of shift assignments of which worker is assigned to which selected shift candidate of the subset of the shift candidates.

Abstract: A system for incremental solution of the shift design and assignment problem comprises an interface configured to receive an incremental change and an existing schedule. The system comprises a processor to determine whether labor demand has changed; in response to labor demand having been changed, generate an updated set of shift candidates; determine a new cost function; restart a solver using the updated set of shift candidates, the existing schedule, the incremental change, and the new cost function, wherein the solver comprises a mixed integer programming (MIP) solver, and wherein the MIP solver determines simultaneously a subset of the shift candidates selected in the final schedule and a set of shift assignments of which worker is assigned to which selected shift candidate of the subset of shift candidates.

Abstract: Disclosed are techniques for increasing the speed of pairwise comparison operations in a database system. In an embodiment, a method is disclosed comprising receiving a network request identifying a user; identifying a plurality of segments associated with the user; loading a plurality of bitmaps associated with the plurality of segments, each bitmap in the plurality of bitmaps representing a set of users associated with a segment; comparing pairs of bitmaps from the plurality of bitmaps to generate a set of overlaps; filtering the plurality of segments based on the set of overlaps to generate an anonymized set of segments; and returning aggregated data associated with the anonymized set of segments in response to the network request.

Abstract: A system comprises an interface configured to receive an identifier, a processor configured to determine a grouping associated with the identifier, wherein the grouping is determined using a first clustering, wherein the first clustering is based at least in part on a language processing system, determine a sub-grouping of the grouping associated with the identifier, wherein the sub-grouping is determined using a second clustering, determine a final identifier based at least in part on the identifier and the sub-grouping, determine a resource based at least in part on the final identifier, and store the final identifier associated with the resource, and a memory coupled to the processor and configured to provide the processor with instructions.

Abstract: Mapping data from a first computer application to a second computer application by obtaining a second organization's application schema with data, generating a mathematical representation of the field keys and the data in the data fields of the second organization's application, extracting data from a first organization's application; processing the data from the first organization's application and data from the second organization's application, and mapping data from the first organization's application into the second organization's application schema.