Abstract: A calculate once use forever (COUF) method to efficiently determine statistics on data records of a data set. Data records are read from an original data set and grouped together into units and simple statistic on each unit are calculated and stored in a database. When a query asking for an additional statistic comes in, the additional statistic can be determined quickly and efficiently from the already calculated unit simple statistics so that read redundancies and computational redundancies can be eliminated.

Abstract: Systems, methods, and computer-readable media for fuzzy-searches on encrypted messages include maintaining, in an indexer, a dictionary of words appearing in a message history. Upon receiving a query including at least one search term, a fuzzy search of the dictionary using the at least one search term is performed to determine one or more fuzzy-matching words in the dictionary, and one or more search tokens are generated from the one or more fuzzy-matching words, the one or more search tokens including encrypted versions of the one or more fuzzy-matching words. The one or more search tokens are provided to a search service for searching a database of encrypted messages of the message history, where the at least one search term may not have an exact match with any of the words in the dictionary.

Abstract: Embodiments of the present disclosure provide a method, apparatus, computer device, and storage medium for verifying community question answer data. The method may include: acquiring a community question answer data set, and generating a plurality of question answer pairs based on the community question answer data set, a question answer pair including: a question, and a to-be-verified answer corresponding to the question; generating an authoritative data set based on data stored in at least one confidence source site; and performing an authority verification on the to-be-verified answer, based on a score of a similarity between the to-be-verified answer and authoritative data in the authoritative data set in at least one dimension.

Abstract: In one embodiment, a method includes receiving a video file. The video file includes a corresponding audio stream. The method further includes accessing the audio stream, and generating, based on the audio stream, a representative vector. The vector has a particular number of dimensions. The method further includes accessing a label-embedding space, which has the same particular number of dimensions, and includes a number of regions that each correspond to a respective label. The method further includes determining a region of the label-embedding space that corresponds to the vector, the determined region corresponding to a particular label. The method further includes associating the particular label with the video file.

Abstract: In an embodiment, a method includes matching terms of a received query to a database of provider capabilities. The method further includes determining, for each portion of the received query, a respective provider to execute the portion of the received query. The method further includes sending each portion of the received query to its respective provider. The method further includes combining results from each respective provider to a returned query result.

Abstract: Embodiments of the present disclosure provide a data migration method and apparatus. The method includes: receiving a migration task of migrating data in a first system to a second system; and calling upper-layer interfaces corresponding to the migration task, and calling underlying operation interfaces of the first system and the second system by the upper-layer interfaces through an abstract interface class to migrate the data of the first system to the second system. Bidirectional data transmission and migration can be implemented between any two data ends. Bidirectional data transmission and migration between any data terminals.

Abstract: A method, apparatus and computer program product for creating parse trees from mixed records is described. A mixed record is received including a first entry containing a first natural language phrase and a second entry containing a first structured data entry. Using the first natural language phrase, a first parse tree structure is created joining words in the first natural language phrase with natural links indicating their semantic relationship within the first natural language phrase. A first synthetic node is created which represents the first structured data entry. The first synthetic is joined to the first parse tree structure using a synthetic link to a node in the parse tree to produce a pseudo parse tree. The pseudo parse tree is sent to a question answer system for answering user queries by reference to the pseudo parse tree.

Abstract: A method, system, and program product for updating buffer pools in a shared disk clustered database system is provided. The method includes generating thread software code for servers of a clustered database system. Cluster-wide lock software configured with respect to a shared mode for servers of the clustered database system is received. A tablespace space reclaim function is executed for moving data pages from a first location of a shared disk structure to a second location resulting in generation of updated data page metadata. The updated data page metadata is stored within the clustered database system and functionality of thread software code is detected. The cluster-wide lock software is reclaimed, enabling remote thread software code. A second cluster-wide lock is utilized to coordinate achievement of an idle state of local and remote threads. An idle state is enabled with respect to servers of the shared disk clustered database system.

Abstract: A method of storing multi-dimensional data, the method comprises encoding a structure of nodes of a tree data structure into an order representation; compressing data of nodes of the tree data structure to create a data stream of compressed data portions of variable length in a sequence corresponding to the order represented in the order representation. Each compressed data portion is formed from the data of each node. The method further comprises mapping the positions of the data portions in the data stream to the order representation to produce a location representation; and storing the order representation, data stream and location representation. A system of storing multi-dimensional data is also disclosed, as well as a method and system for retrieving stored multi-dimensional data.

Abstract: A logical graph is generated using at least a portion of log data received from a set of agents executing on one or more nodes in one or more data centers. The logical graph is generated at least in part by clustering a first set of nodes using a first clustering criteria. The logical graph is augmented at least in part by performing a reclustering operation using a second clustering criteria.

Abstract: The disclosure relates to information recommendation systems and methods. The information recommendation methods may include: obtaining information selected by a user or information retrieved by the user; analyzing the selected information or the retrieval information; determining a retrieval path based on a result of analyzing the selected information or the retrieval information; retrieving other information related to the selected information based on the retrieval path; and recommend the other information to the user. The information recommendation systems may include a computer-readable storage medium; codes stored in the computer-readable storage medium; and a processor; when executing the codes, the processor may perform the above-mentioned information recommendation methods.

Abstract: An embodiment of the present invention is directed to creating and implementing an innovative table-level stored procedure that builds and executes the necessary query dynamically based on the parameter values passed from the calling program.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for distributed data processing. One of the methods includes: generating a first Bloom filter based on data of a local device, and sending the first Bloom filter to a remote device; receiving a second Bloom filter from the remote device, wherein the second Bloom filter is generated by the remote device based on data of the remote device; filtering data of the local device by using the first Bloom filter and the second Bloom filter to produce successfully filtered data and unsuccessfully filtered data; and performing a join operation on unsuccessfully filtered data.

Abstract: A method relates to backing up a VM. The method can include placing an application being hosted by a VM in a backup state and capturing a snapshot of the VM to generate a VM image of the VM. The method can further comprise resuming the application, extracting application blocks corresponding to the application from the mounted VM image, and storing the application blocks and the VM image.

Abstract: Systems, methods, and computer-readable storage media for processing database requests on a database hosted on a stateless, non-persistent computing environment are provided. A server stores database requests to insert update or delete data in a unit of work set identified by a unique code. The database requests are performed on the database upon receiving an instruction to commit the database requests to the database. If an instruction is sent to rollback a unit of work set the database remains unchanged. This allows a client to handle requests in logical groups.

Abstract: A method, computer system, and a computer program product for compressing at least one delta file for a plurality of genomic data files is provided. The present invention may include receiving the plurality of genomic data files as input. The present invention may also include determining a plurality of rows by traversing the received plurality of genomic data files. The present invention may then include comparing the plurality of rows associated with the traversed plurality of genomic data files. The present invention may further include generating a plurality of resulting delta files based on the compared plurality of rows. The present invention may also include compressing the generated plurality of resulting delta files by utilizing a general purpose file compressor.

Abstract: Disclosed embodiments provide improvements in integration template generation. In embodiments, existing customer integration flows already created by users are analyzed using computer-implemented methods, and from these customer integration flows, templates are created that encapsulate the general patterns that are seen in existing customer integration flows. The customer integration flows are anonymized by removing proprietary and/or identifying data. The result is customer integration templates based on actual real-world usage, which can more accurately resemble the needs of customers as compared to traditional templates that are authored by someone envisioning how he thinks the applications will be linked together, but not based on how they actually are used. Disclosed embodiments can generate integration templates based on general patterns encountered by multiple users that serve as a good starting point for any user that wants to do similar integrations.

Abstract: A distributed network of participating Extract Transform Load (ETL) servers is received. Data source mappings are generated for the distributed network, where the data source mappings indicate which participating ETL servers in the distributed network have access to which tables in data sources. Network metrics are obtained that indicate, for each pair of participating ETL servers, an average data transmission speed and a unit cost. Data source metrics are obtained for the tables in the data sources. A link mappings table is generated that lists mappings of each link to a network in between participating ETL servers. A plurality of distributed execution plans are generated using the network metrics, the data source metrics, and the link mappings table. An execution plan is selected from the plurality of execution plans according to an optimization criteria. The selected execution plan is executed.

Abstract: This specification describes techniques for managing assets in a blockchain. One example method includes receiving, from a target user recorded in a distributed database of the blockchain network, a user input including a request to generate an asset object in the blockchain network, the blockchain network including an account object and a contract object, determining, based on the user input, an asset type of the asset object, initiating, in the blockchain network, the contract object corresponding to generate the asset object based on the asset type, the asset object including a digital asset corresponding to a physical asset associated with the target user, assigning the asset object to a target object of the target user, and adding address information of the asset object to the target object.

Abstract: A system can comprise one or more processors; and one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processors and perform: receiving a request for a write operation of an input record in a data store associated with a sharded database and an alternate-key-global-index (AKGI) database; generating a new optimistic lock value, the new optimistic lock value being unique in the sharded database; when the data store does not include a data record associated with the input record, creating the dummy data record in the data store; locking the data record for the write operation by setting the DROpLock of the data record to the new optimistic lock value; and performing the write operation of the input record in the AKGI database and the sharded database.