Abstract: Described is a system (and method) for application-based packing for storing backup data within an object storage. More particularly, the system may efficiently pack backup files into objects having a specialized size by accounting for the source and size of the backup file. For example, the system may determine whether backup files associated with a particular application may be stored within individual objects or packed together within a shared object. Accordingly, by accounting for such criteria the system may perform an intelligent allocation of backup data within a cloud-based object storage. The system may be implemented as part of an incremental backup infrastructure. Accordingly, when allocating the backup files amongst objects, the system may also store specialized metadata to preserve the ability to perform a reconstruction of data (e.g. synthetically) as if a full backup was performed.

Abstract: Systems, methods, and computer-executable instructions for synthesizing facts from multiple sources. A user search string associated with a topic is received. Queries associated with the user search string are generated. Website content is queried, using the plurality of queries associated with the user search string, to generate results. The results are ranked based on a first feature. The results are filtered based on the first feature to generate intermediate results. The intermediate results are ranked based on a second feature. The second feature is most costly to calculate than the first feature. The filtered intermedia results are filtered based on the second feature to generate final results. Distinct facts from the final results are determined. The distinct facts include content from different URLs. The distinct facts associated with the topic are returned.

Abstract: Techniques are disclosed for providing scalable and concurrent file systems. A backend storage system comprising an interface and a processing unit may be configured to perform the techniques. The interface may present the file system storing objects representative of data. The processing unit may receive, from a frontend host system coupled to the backend storage system, a plurality of client operations to perform with respect to the objects identified by the client operations, and identify an object type associated with each of the identified objects. The processing unit may select, based on the object types, one or more backend operators that implement the plurality of client operations, and apply the backend operators to the identified objects.

Abstract: Adding a column into a worksheet, including: receiving, via a spreadsheet interface comprising a first worksheet, a request to add a new column to the first worksheet, wherein the request includes a key that identifies a reference column in the first worksheet, a specification of a second worksheet that comprises a corresponding reference column related by the key, and a specification of a data column in the second worksheet, wherein each entry of the data column is associated with an entry of the corresponding reference column in the second worksheet, and entries to be included in the requested new column will be based on the entries of the data column; generating, based on the request, a database query; and receiving, from a database and in response to the database query, a query result comprising the new column to be added to the first worksheet.

Abstract: Techniques are described herein for managing transactions between data consumers and data providers using a blockchain. In some embodiments, a blockchain network receive smart contracts that govern access rights to data sets provided by blockchain members and smart contracts that execute blockchain transactions based on the usage of data sets. When a data set is provided to a blockchain member through the blockchain network, usage of the data set may be tracked. Responsive to detecting usage of the data set, one or more smart contracts may execute one or more blockchain transactions within the blockchain network.

Abstract: In some embodiments, a method sends first messages that request first information for a set of blocks of the blockchain to the N replicas. Each replica maintains a respective instance of the blockchain. Second messages is received from at least a portion of the N replicas. The second messages include the first information for the set of blocks from each respective instance of the blockchain that is maintained by the N replicas. The method analyzes the first information to determine whether a consensus on the first information is reached by a number of replicas. When consensus is reached, a request is sent to a replica for one or more blocks to back up to a backup blockchain and second information is received for the one or more blocks from the replica. The method uses the second information to back up the one or more blocks in the backup blockchain.

Abstract: A process of extending retention periods of records. In operation, an electronic computing device identifies a retention period associated with the record. The device obtains information related to a future event. The information includes a time period during which the future event is predicted or scheduled to occur and a location at which the future event is predicted or scheduled to occur. When the device determines that the record is contextually related to the future event based at least in part on the time period or the location of the future event, the retention period associated with the record is extended. The device may also automatically extend retention periods of records based on a number of other retention-related factors associated with the record including recording content, record trustworthiness, recording time, recording location, recording data type, recording source, recording officers' profile and their association, crime statistics, incident severity, and the like.

Abstract: In an example embodiment, a solution is used to provide container volume replication via a container storage replication log and volume buffer synchronization, which is built on top of a container cloud platform whose container metadata and replication runtime configuration are all managed by a storage manager (a service orchestrated by its job scheduler and service orchestrator). This container volume replication ensures the data security for a long-running service in the container. In the case of any disaster, the in-memory database and application data inside of the container can be recovered via volume replication. This provides container volume replication for long-running containerized applications whose states keep changing.

Abstract: Systems and methods are disclosed that allow for indexing, processing, or both of information from physical media or electronic media, which may be received from a plurality of sources. In embodiments, a document file may be matched using pattern matching methods and may include comparisons with a comparison reference database to improve or accelerate the indexing process. In embodiments, information may be presented to a user as potential matches thereby improving manual indexing processes. In embodiments, one or more additional actions may occur as part of the processing, including without limitation, association additional data with a document file, making observations from the document file, notifying individuals, creating composite messages, and billing events. In an embodiment, data from a document file may be associated with a key word, key phrase, or word frequency value that enables adaptive learning so that unindexed data may be automatically indexed based on user interaction history.

Abstract: A data manager receives a first data layout from a data source and classifies the first data layout as corresponding to a first data domain. The data manager compares the first data layout with one or more existing data layouts that are already classified as corresponding to the first data domain and detects that at least one attribute and corresponding dataset of the first data layout matches with a second attribute and corresponding second dataset from an existing data layout. Data manager generates a second data layout corresponding to the first data layout, wherein the second data layout is a copy of the first data layout with the at least one attribute and the corresponding dataset from the first data layout replaced by the second attribute and the second dataset from the first existing data layout. Data manager loads a data warehouse from the second data layout.

Abstract: A data processing method includes: generating a service serial number for a target service according to a preset naming rule; obtaining service data of the target service; obtaining a target data table from a plurality of pre-configured data tables, according to the service serial number; and storing the service data to the target data table.

Abstract: One or more computing devices, systems, and/or methods for generating a list of suggested queries associated with one or more keywords are provided. For example, one or more keywords may be received via a search interface. A plurality of queries associated with the one or more keywords may be determined based upon the one or more keywords and a historical query database. A plurality of relationship scores associated with the plurality of queries may be generated based upon a plurality of search sessions associated with the historical query database. The historical query database may be analyzed to determine a plurality of click rates associated with the plurality of queries. A list of suggested queries may be generated based upon the plurality of relationship scores and the plurality of click rates.

Abstract: Approximate nearest neighbor (ANN) searching is a fundamental problem in computer science with numerous applications in area such as machine learning and data mining. For typical graph-based ANN methods, the searching method is executed iteratively, and the execution dependency prohibits graphics processor unit (GPU)/GPU-type processor adaptations. Presented herein are embodiments of a novel framework that decouples the searching on graph methodology into stages, in order to parallel the performance-crucial distance computation. Furthermore, in one or more embodiments, to obtain better parallelism on GPU-type components, also disclosed are novel ANN-specific optimization methods that eliminate dynamic memory allocations and trade computations for less memory consumption. Embodiments were empirically compared against other methods, and the results confirm the effectiveness.

Abstract: A system and method of immutable electronic health record data storage is presented. The present disclosure provides for a system integrated into a practical application with meaningful limitations to provide a system having an ‘immutable data storage protocol’ used to capture database operations on an immutable ledger. The protocol can consist of one or more ‘operation codes.’ The immutable electronic health record data storage system can provide a blockchain, transaction blockchain API, a blockchain writer API, a formatting module, and a messaging module, among others, that can format, process, and store data according to an immutable data storage protocol.

Abstract: The present disclosure relates to a method for determining a completion score for a record object based on electronic activities. The method includes accessing record objects, each of which corresponds to a record object type and includes object fields having object field-values. The method includes selecting one of the record objects. The method includes identifying electronic activities transmitted or received associated with the record object. Each of the electronic activities has a timestamp indicating a receipt time or transmission time of the respective electronic activity. The method includes determining a participant of each of the electronic activities. The method includes determining a completion score indicating a likelihood of completing an event associated with the record object based on the timestamp of each of the electronic activities and the participant of each of the electronic activities. The method includes storing an association between the record object and the completion score.

Abstract: An apparatus and method for providing a performance data output for a user is provided. Apparatus may include a computing device including a processor, which may receive a user datum and generate an interface query data structure including at least a query including an input field based on the user datum. The interface query data structure may configure a remote display device to display the input field to the user, receive at least a user-input datum into the input field, retrieve data describing attributes of the user from a database communicatively connected with the processor, and refine the interface query data structure based on data describing attributes of the user from the database. The processor may use a machine learning model including a classifier to correlate the user datum to the interface query data structure and data multipliers into a list and accordingly generate a strategy data.

Abstract: Exemplary systems, implement a multi-tenant blockchain platform for managing the Einstein cloud platform's decisions using Distributed Ledger Technology (DLT) in conjunction with a cloud based computing environment. The system operates a blockchain interface to a blockchain on behalf of a plurality of tenants of the host organization, configures the blockchain to share a training data set between two or more tenants pursuant to a consent agreement, trains an AI model to make recommendations based on the training data set, receives a request to register the AI model with an audit record keeping service, receives a transaction at the blockchain, issues a decision by the AI model to accept or reject the transaction; and then proceeds to transact a new asset onto the blockchain recording the decision to accept or reject the transaction and the data set utilized to train the AI model with a version of the AI model.

Abstract: Disclosed are an input/output proxy method and apparatus for a mimic Redis database. Through a pseudo server module, it is ensured that the interface of the Redis database is consistent with the external interface of the native Redis, so that it is convenient to implant the Redis database into arbitrary Redis application scenarios; the isolation of the modules inside is realized by independent processes, thus facilitating independent development, maintenance and expansion; and the synchronization function is integrated into the input/output proxy to achieve resource reuse; for the synchronization function, the random credit attenuation mechanism is cleverly utilized to ensure the synchronization function while taking into account the saving of resources.

Abstract: A database image may be updated with incremental changes without replicating the production database. Each set of changes to the production database are stored in a differencing disk. Two or more identical chains of differencing disks are created. One chain is an active chain, and database clones may be served from the active chain for use by users. After reaching a predetermined length on an inactive chain, the differencing disks on the inactive chain are merged into a single merged differencing disk, and the inactive chain becomes an active chain, from which new database clones may be served to users. The chains may alternate between being inactive and active chains.

Abstract: One or more techniques and/or computing devices are provided for managing an arbitrary set of storage items using a granset. For example, a storage controller may host a plurality of storage items and/or logical unit numbers (LUNs). A subset of the storage items are grouped into a consistency group. A granset is created for tracking, managing, and/or providing access to the storage items within the consistency group. For example, the granset comprises application programming interfaces (APIs) and/or properties used to provide certain levels of access to the storage items (e.g., read access, write access, no access), redirect operations to access either data of an active file system or to a snapshot, fence certain operations (e.g., rename and delete operations), and/or other properties that apply to each storage item within the consistency group. Thus, the granset provides a persistent on-disk layout used to manage an arbitrary set of storage items.