Abstract: One or more computer processors facilitate compatibility between one or more multivariate regression models and a multidimensional dataset, wherein the program instructions. The one or more computer processors extract a plurality of unidimensional chains from the multidimensional dataset. The one or more computer processors double index the plurality of extracted unidimensional chains. The one or more computer processors construct a plurality of partial fit regression trees from the double indexed unidimensional chains. The one or more computer processors, responsive to a stop criterion, calculate one or more predictions utilizing the plurality of constructed partial fit regression trees. The one or more computer processors repopulate the multidimensional dataset with the one or more calculated predictions.

Abstract: A selective database rollback method includes identifying a table, identifying a root key, storing a target rollback date, retrieving schema information including keys, ordering the table, iterating over the table, storing the current table state, obtaining a transaction journal, and reverse-applying the transaction journal to generate an output file. A method or system for identifying database key includes iterating over a table's columns and rows, generating similarity metrics by comparing column-wise and/or row-wise data, and comparing the generated similarity metrics to a threshold value. A server includes a processor and a memory storing instructions that, when executed by the one or more processors, cause the server to identify a table, identify a root key, store a target rollback date, retrieve schema information including keys, order the table, iterate over the table, store the current table state, obtain a transaction journal, and reverse-apply the transaction journal to generate an output file.

Abstract: Systems and methods for automatically associating content characteristics to a third-party content are provided. A uniform resource locator identifying a resource is received from a content provider. The content is rendered to produce an object tree. A first node of the object tree is determined, where the first node represents a content slot. A second node of the object tree proximate to the first node is identified. The second node has a content characteristic, which is extracted. The extracted content characteristic is associated with the first node and stored.

Abstract: An example operation includes one or more of receiving a block, extracting information from the block, correlating an identifier to the information as previously stored in a first storage area, replacing the information in the block with the identifier, and submitting the block with the identifier for storage in a second storage area. The identifier links to the information previously stored in the first storage area in order to allow for recovery of the information, and at least the second storage area is in a blockchain.

Abstract: An encrypted search uses hash vectorization (HV) models, which are secure, one-way hash indices that are produced by a compression process, such as a modeling phase of Lempel-Ziv (LZ) parsing. Each HV model includes a hash filter and a chain vector. The hash filter is a Boolean quotient filter similar to Bloom filters, and allows for the quick elimination of negative query assessments. The hash filter is followed by a chain vector, which provides spatial modeling of hashed elements throughout the compressed and encrypted data, thereby providing increased levels of accuracy, efficiency, and query expressiveness as compared with known techniques.

Abstract: A computer implemented system for genomic data sorting, comprising alignment and position mapping. The system maps each read to a position on the reference genome with which the read is associated, followed by sorting these reads by their mapped positions.

Abstract: Various techniques for accelerating Smith-Waterman sequence alignments are provided. For example, threads in a group of threads are employed to use an interleaved cell layout to store relevant data in registers while computing sub-alignment data for one or more local alignment problems. In another example, specialized instructions that reduce the number of cycles required to compute each sub-alignment score are utilized. In another example, threads are employed to compute sub-alignment data for a subset of columns of one or more local alignment problems while other threads begin computing sub-alignment data based on partial result data received from the preceding threads. After computing a maximum sub-alignment score, a thread stores the maximum sub-alignment score and the corresponding position in global memory.

Abstract: Systems and methods for virtual image testing. An example method may comprise receiving, by a messaging application, an identifier of a file residing a file system. Configuring a file serving process to respond to content requests specifying the file. Transmitting, by the messaging application, a notification comprising a uniform resource locator derived from the file identifier.

Abstract: Anchor tree cross-merge within a distributed storage system. A computer system identifies a data structure that includes (i) a root anchor tree and (ii) an ordered set of anchor trees that are ordered based on their creation, such that a last anchor tree of the ordered set of anchor trees is most-recently created. The data structure stores index data for a set of objects stored in a non-volatile storage. The computer system creates a new anchor tree in the ordered set of anchor trees. The computer system identifies, from a set of delta tables, index data representing one or more objects that are stored on the non-volatile storage. The computer system merges the index data representing the one or more objects into the new anchor tree.

Abstract: A request may be received to access a digital asset uniquely identified by an identifier within an on-demand database system configured to provide computing services to a plurality of entities via the internet. Ownership of the digital asset may be determined based on ownership of a designated smart contract recorded in a public trust ledger. A plurality of related smart contracts recorded in the public trust ledger may be identified. Each of the related smart contracts may be linked with the designated smart contract. Two or more of the smart contracts may each include a respective one or more non-fungible tokens related to the digital asset. A respective state for two or more of a plurality of modifiable values may be determined. Each of the modifiable values may be being stored within a respective one of the plurality of related smart contracts within the public trust ledger.

Abstract: An electronic device is disclosed that includes a display, a communication circuitry, a first memory storing a native web application including a first resource, a second memory loaded with instructions included in the native web application, and a processor operatively connected with the display, the communication circuitry, the first memory, and the second memory.

Abstract: A distributed storage method includes offline merging, by a first thread service of a distributed storage system, M small files in a file system; generating, by the first thread service, M pieces of metadata in the offline merging process; loading, by a second thread service of the distributed storage system, the M pieces of metadata into a metadata set; searching, by the second thread service, the metadata set for metadata of a first small file when the second thread service receives a first instruction; and performing, by the second thread service, the operation corresponding to the first instruction when the second thread service finds the metadata of the first small file in the metadata set.

Abstract: Systems and methods to intelligently optimize data collection requests are disclosed. In one embodiment, systems are configured to identify and select a complete set of suitable parameters to execute the data collection requests. In another embodiment, systems are configured to identify and select a partial set of suitable parameters to execute the data collection requests. The present embodiments can implement machine learning algorithms to identify and select the suitable parameters according to the nature of the data collection requests and the targets. Moreover, the embodiments provide systems and methods to generate feedback data based upon the effectiveness of the data collection parameters. Furthermore, the embodiments provide systems and methods to score the set of suitable parameters based on the feedback data and the overall cost, which are then stored in an internal database.

Abstract: Updating multiple data records in a database system with at least one database and a first server comprises creating a first session and loading, within the first session, the multiple data records stored by the database into a memory of the first server. Update at least a first and a second of the multiple data records during the first session in the memory of the first server. A database transaction mechanism writes back the multiple data records after updating the at least first and second data records to the database which insures that either all or none of the updated database records are committed. The database transaction mechanism includes a write lock over the first and second data records stored in the database.

Abstract: Systems and methods for updating policy profiles can include utilizing one or more machine learning processes to determine a probability of the likelihood that an available insurance policy data point within a set of currently available policy data points is incorrect. The system may further generate a plurality of policy profile data points based on those determined probabilities. This plurality of policy profile data points can be associated with various customer insurance policies. The system can further parse the plurality of data points for collection, generate uniform resource locator data for each data point type and associate each data point with uniform resource locator data. Finally, the system can utilize the generated uniform resource locator data to locate and copy updated data point data related to the associated data point for each data point and format the data point data for transmission to an agent management system for further processing.

Abstract: A storage control system receives a first data block to be written to a primary storage, and generates a content signature for the first data block. The storage control system adds a first entry for the first data block into a persistent deduplication database. The first entry comprises a key which comprises the content signature for the first data block. The persistent deduplication database comprises a tree data structure which comprises elements that are configured to store entries for data blocks. The storage control system merges the entries of at least two elements of the tree data structure to generate a set of merged entries which comprises the first entry for the first data block, and a second entry for a second data block, and commences a deduplication process in response to determining that the first entry and the second entry in the set of merged entries have matching keys.

Abstract: A database system as well as a method and an apparatus for querying a database are disclosed herein. In one embodiment, a system comprises a master database, at least one slave database, and a query processing unit. The master database has a data connection with the slave database, and the slave database has a data connection with the query processing unit. The query processing unit is configured to split a query request into query operation instructions having non-overlapping query ranges, send the split query operation instructions to the same or different slave databases to perform the query operations, and return the query results. The disclosed embodiments improve query efficiency.

Abstract: Techniques for augmenting or modifying ordered results include sending a search query to a location service, receiving ordered results responsive to the search query, and augmenting or modifying the search results based on user-specific information stored locally at a consumer computing device. The ordered results may be augmented by reordering a search result in the list of search results based on the user-specific information, and/or by graphically representing a location included in the ordered search results based on the user-specific information. The augmented search results may be presented on a display associated with the consumer computing device in a manner specific to a user of the consumer computing device.

Abstract: A search engine for objects in a corpus of document dynamically evaluates search rank of the objects through Natural Language Processing and machine learning. When a search query is received for a first object, the search engine identifies search results including a plurality of source values that are tied to the first object in the corpus of published documents. A search rank is computed for each identified search result based on content of direct textual references to each of the plurality of source values within the corpus of published documents, as well as a weight assigned to each published document. The identified search results are returned according to the computed search rank.

Abstract: Disclosed are systems, apparatus, methods and computer-readable media for updating information stored in a database system over a network. In some implementations, first contact data is retrieved from a first virtual portion of a database system, where the first contact data provides first contact information associated with at least one entity. In some instances, the first contact data is compared with second contact data, where the second contact data provides second contact information associated with the at least one entity. In some instances, at least some of the second contact information is retrieved from a social networking system. In various implementations, at least one difference between the first contact data and the second contact data is identified, where the at least one difference is capable of being presented in a user interface displayed at a computer system. In some instances, a selection identifying contact data to store is received.