Abstract: Implementations of the present disclosure include receiving a merger request including a first identifier of a first node, a second identifier of a second node, and an identifier of a first smart asset, the first smart asset being associated with the first node, determining whether the first smart asset is capable of merger with a second smart asset associated with the second node at least partially based on the identifier of the first smart asset and an identifier of the second smart asset, and, in response to determining that the first smart asset is capable of being merged with the second smart asset, automatically: updating the second smart asset, the updated second smart asset being assigned a value, and including properties of the first smart asset, recording the updated second smart asset to the second node, and deleting the first smart asset.

Abstract: A method for clustering product media files is provided. The method includes dividing each media file corresponding to one or more products into a plurality of tiles. The media file include one of an image or a video. Feature vectors are computed for each tile of each media file. One or more patch clusters are generated using the plurality of tiles. Each patch cluster includes tiles having feature vectors similar to each other. The feature vectors of each media file are compared with feature vectors of each patch cluster. Based on comparison, product groups are then generated. All media files having comparison output similar to each other are grouped into one product group. Each product group includes one or more media files for one product. Apparatus for substantially performing the method as described herein is also provided.

Abstract: Techniques for selecting a storage node of a storage system to store data include applying a first function to at least some data chunks of an extent to provide respective first values for each of the at least some data chunks. A storage node, included within multiple storage nodes of a storage system, is selected to store the extent based on a majority vote derived from the respective first values.

Abstract: Computer file copy systems and methods in which a list of files to be transferred from storage on a source file storage computer is sorted by one or more processors of a copy computer in ascending order from a smallest file size to a largest file size. Thereafter, files having the smallest file sizes are selected from the sorted files such that a total size of the selected files is equal to or less than a total size of memory available on the copy computer, the selected files are copied concurrently with one another from storage on the source file storage computer to the available copy computer memory by the one or more processors, the files are written concurrently with one another from the memory on the copy computer to storage on a target file storage computer by the one or more processors, and the process is performed iteratively.

Abstract: A system and method for exposing volumes with underlying read-write mediums to user operations. When a medium is in the process of being replicated to a storage array, a volume which relies on the medium can be exposed to user operations (e.g., snapshots, read and write operations) once the portions of the medium which underlie the volume have been replicated. The volume can be exposed to user operations while one or more other portions of the medium are unfilled and while the medium is in an intermediate read-write state.

Abstract: In general, the subject matter described in this specification can be embodied in methods, systems, and program products. A score for each of a plurality of authors of posts submitted to a server system is determined. The score for each individual author in the plurality is based on a score of one or more authors in the plurality that have requested to subscribe to a stream of posts that the individual author submits to the server system. A particular post submitted by a particular author in the plurality is received at the server system and from a computing device. A score is assigned to the particular post based on a score of the particular author. The particular post is transmitted from the server system to computing devices that are associated with authors who have requested to subscribe to posts by the particular author.

Abstract: Systems and methods for supporting multi-tenancy in a multi-tenant application server environment are provided. A first partition in a multi-tenant server environment can include a first composite and the first composite includes first metadata that is configured to be customized for a first tenant of the first partition. A second partition in the multi-tenant server environment can include a second composite and the second composite includes second metadata that is configured to be customized for a second tenant of the second partition. A global runtime in the multi-tenant server environment can include a global composite and the global composite include global metadata that is configured to be shared by the first partition and the second partition.

Abstract: A capability for updating a cache. The capability includes identifying, in a query instance that has led to a filling of the cache, a parameter whose values are monotonic—in particular monotonically increasing or decreasing—over time, wherein the query instance has a first execution time. When generating a new query instance, at a second, later execution time instead of the previous value of the parameter, a new value may be used that corresponds to the monotonic previous value at the second execution time. The new query instance is executed, wherein the cache is updated with the results of the new query instance.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage devices, for data processing and storage. One of the systems includes a multi-tier storage subsystem including multiple tiers of storage devices, an input/output (I/O) subsystem that is configured to perform a write operation of blockchain data into a data log file, and a back-end data management subsystem that is configured to perform a management operation of the data log file stored in the one of the multiple tiers of storage devices.

Abstract: Performing data analytics processing in the context of a large scale distributed system that includes a massively parallel processing (MPP) database and a distributed storage layer is disclosed. In various embodiments, a data analytics request is received. A plan is created to generate a response to the request. A corresponding portion of the plan is assigned to each of a plurality of distributed processing segments, including by invoking as indicated in the assignment one or more data analytical functions embedded in the processing segment.

Abstract: A join operation between split data tables includes providing reduction data from first partitions to each partition among second partitions. The reduction data serves to identify actual values in one of the second partitions that also occur in one of the first partitions. Global IDs are assigned. Translation lists including the global IDs are sent to the first partitions. Each first partition and each second partition create globalized lists which can then be combined to generate respective first and second compiled lists. The join operation can then be conducted on the first and second compiled lists.

Abstract: This application provides a search apparatus, including a global dispatcher, a global arbiter, and N search engines. The N search engines can access a first search table. The global dispatcher is configured to: determine that a first search keyword is corresponding to the first search table and dispatch the first search keyword to the N search engines. Each search engine is configured to: search, according to a first search algorithm, one subtable to determine whether an entry that matches the first search keyword exists; and output a search result to the global arbiter. The global arbiter is configured to arbitrate the search result output by each search engine, to obtain a search result corresponding to the first search table.

Abstract: A system and method to create a clone of a source computing system, the system including the steps of selecting a memory space coupled to the source computing system, retrieving uncoded data from the selected memory space, encoding the uncoded data by use of a bit-marker-based encoding process executing on a backup server, storing encoded data in a protected memory coupled to the backup server, wherein the protected memory is protected from a power interruption, retrieving the encoded data from the protected memory; and decoding, the encoded data onto a target computing system, wherein the target computing system is separate from the source computing system.

Abstract: Techniques are presented herein for storing cursor duration temporary tables in memory of nodes in a clustered database system in association with iterations of an iterative query operation. The techniques involve associating a portion of memory with one or more iteration values. The iteration values indicate which iterations correspond to data that is stored in the portion of memory. When data is requested for a particular iteration, portions of memory are checked to determine if it stores the particular iteration.

Abstract: A general type weight and an individual weight are determined for each of multiple social media accounts. The general type weight may be based on a social media account type corresponding to the social media account. The method may include encoding a mutually reinforcing relationship between the social media accounts and contents promoted by each of the social media accounts. The mutually reinforcing relationship may be encoded as a promotional link between the social media accounts and a content item of the contents promoted by each of the social media accounts. The method may include calculating a basic link strength for each promotional link, where the basic link strength is based on the general type weight and the individual weight for each social media account of multiple social media accounts, and calculating a mutually reinforcing ranking of the multiple social media accounts and contents based on the basic link strengths.

Abstract: In one embodiment, the present invention includes a computer-implemented method comprising storing data in an application using an application custom data type and application custom data structure. The data is stored in a database using the application custom data type and the application custom data structure. In one embodiment, a request is sent to access the data from the application to the database. The data is retrieved from the database in response to the request in the application custom data type and the application custom data structure. In one embodiment, the data is sent from the database to a shared memory in the application custom data type and the application custom data structure and the data is retrieved by the application from the shared memory in the application custom data type and the application custom data structure.

Abstract: A mechanism is described for facilitating dynamic data management for computing devices according to one embodiment. A method of embodiments, as described herein, includes tracking one or more factors relating to a plurality of data sets, evaluating the plurality of data sets based on the one or more factors. The evaluating may include speculating at least one of relevancy and accessibility of each of the plurality of data sets. The method may further include generating data scores, the data scores being associated with the plurality of data sets based on the evaluation of the plurality of data sets, performing a first comparison of the data scores of the plurality of data sets with a criteria score, and classifying each data set based on the first comparison. The classifying may include setting caching order for each data set of the plurality of data sets.

Abstract: A computer system has a database constructed from storage areas in each of a plurality of computers, which stores data including an operation number for managing an operation status by transaction processing. The data is allocated to the computers in accordance with predetermined management ranges, and the computers include a control module configured to generate an operation history indicating specifics of each operation included in the piece of transaction processing in a case of receiving an execution request. A distribution module determines a sequence number of applying a plurality of operation histories to the database and transmits them to the other computers. A conflict judgment module determines whether a piece of transaction processing corresponding to an operation history conflicts based on the operation number; and an applying module operates the database based on an operation history corresponding to a piece of transaction processing to the database determined not to conflict.

Abstract: Data records of a data set can be stored in multiple main part fragments retained in on-disk storage. Each fragment can include a number of data records that is equal to or less than a defined maximum fragment size. Using a compression that is optimized for each fragment, each fragment can be compressed. After reading at least one of the fragments into main system memory from the on-disk storage, an operation can be performed on the fragment or fragments while the in the main system memory.

Abstract: Systems and methods for reviewing medical images. One system includes an electronic processor configured to create a data structure for tracking anatomical findings. The electronic processor is further configured to receive a first annotation marking a first anatomical finding within a first electronic medical image, wherein the first electronic medical image was captured during a first imaging procedure of an anatomical structure, and add data to the data structure representing a first parameter of the first anatomical finding. The electronic processor is also configured to receive a second annotation marking a second anatomical finding within a second electronic medical image, wherein the second electronic medical image was captured during a second imaging procedure of the anatomical structure, and add data to the data structure representing a second parameter of the second anatomical finding. The electronic processor is also configured to display at least a portion of the data structure.