Abstract: Embodiments of the disclosure provide systems and methods for identifying hierarchically related files stored in a database. According to one embodiment, this can be accomplished using a pipeline of worker applications which each use a specific table stored in the database 35 and a sequence or series of queues. Generally speaking, each worker application can read a message identifying tasks to be performed from one queue in the sequence of queues, perform those tasks using the appropriate table from the database to identify a set of files, and write one or more messages to a subsequent queue in the sequence or series of queues to pass results and/or further tasks to be performed to a subsequent worker application in the pipeline of worker applications.

Abstract: This document describes techniques and devices for a refined search with machine learning. These techniques improve computer-aided searches through enabling selection of search criteria used in a prior search and providing a refined search result based on that selection. Furthermore, a machine-learning component of a search engine can be altered to improve future search results based on the selection and an indication of the desirability of the refined search result.

Abstract: Collaborative-filtered content recommendations with justification in real-time is described. A recommendation system determines these recommendations, in part, by identifying digital content items of a catalog that are associated with a single attribute used to describe digital content. The attribute used for the identification is based on affinity scores computed for a client device user to which the recommendations are being provided. These affinity scores indicate the client device user's affinity for different attributes used to describe the digital content. Once the digital content items are identified based on the one attribute, the recommendation system is then limited to ranking and selecting from the identified digital content items to provide the recommendations. The recommendation system does not process the entire catalog of digital content items at once to rank and select the items.

Abstract: A non-transitory computer-readable storage media storing program instructions which, when executed by one or more processors, cause the one or more processors to perform: receiving a query to the distributed file system; determining a particular partition, associated with the data warehouse system, targeted by the query; accessing a repository associated with the data warehouse system to determine whether a partition-to-cluster mapping entry for the particular partition targeted by the query exists in the repository; in response to a determination that the entry for the particular partition exists in the repository, obtaining, from the entry for the particular partition, an identifier of a particular cluster to which the particular partition is assigned by the entry for the particular partition, the particular cluster being one of a plurality of clusters of the distributed file system, each cluster of the plurality of clusters having one name node and a plurality of data nodes.

Abstract: Techniques for inserting and extracting geolocation data using spatial indexing in a key value database are provided. In an embodiment, a system is provided for generating one or more geohashes for a geometry object, wherein the one or more geohashes comprises encoded bits that are stored as keys in a key value database. In one example, the system comprises a geometry indexing component that generates a spatial index, wherein the spatial index is based on a total number of the encoded bits generated for the one or more geohashes. In one example, the system comprises a geometry storing component that stores the geometry object and the one or more geohashes in the key value database using the spatial index to allow for faster retrieval of the geometry object. The advantage is that properly inserted and indexed spatial data can be quickly retrieved.

Abstract: A data management device includes a persistent storage and a processor. The persistent storage includes an object storage. The processor segments a file into file segments. The processor generates meta-data of the file segments. The processor stores a portion of the file segments in a data object of the object storage. The processor stores a portion of the meta-data of the file segments in a meta-data object of the object storage.

Abstract: A heuristic method for the data clustering problem includes a greedy algorithm, which selects the centroids of well-separated clusters, and a single-solution-based heuristic, which performs clustering with the objective of optimizing a cluster validity index. The attributes of the centroids of clusters are genes and a fitness is determined for each gene. A mutation operation changes the values of the genes of low fitness values and creates a mutant solution. The values of genes of the mutant can replace the values of the genes of the parent if they are better than the genes of the parent. Diversification in the search process is maintained by allowing, with a small probability, the genes of the mutant to replace the genes of the parent even if they are not better than them.

Abstract: An online system is configured to recommend a live video to a target user by presenting the live video in the target user's newsfeed or other location. The online system receives a plurality of live videos for streaming to its users. To recommend a live video, the online system dynamically identifies a topic of each of the plurality of live videos during the streaming. The online system further selects a group of candidate live videos, each of which has an identified topic matching an interest of the target user. The online system ranks the candidates based on a probability that the target user would positively interact with each candidate live video if the candidate live video is presented to the target user. Then the online system provides a candidate above a threshold level in the ranking for display to the target user, e.g., in a newsfeed of the target user.

Abstract: A method for providing a relational DID (decentralized identifier) service is provided. The method includes steps of: if a specific entity's device broadcasts to a blockchain network a request for registration of relational information which represents a relation between a specific entity's DID and another entity's DID and is set by another entity and confirmed by a specific entity, a blockchain node in the blockchain network (i) verifying the request and registering the relational information in the blockchain network as corresponding to the specific entity's DID and said another entity's DID or (ii) transmitting the request to an identity contract registered in the blockchain network, to allow the identity contract to verify the request and to register the relational information in the blockchain network as corresponding to the specific entity's DID and said another entity's DID.

Abstract: For query auto completion (QAC) in an eCommerce platform with constantly changing product supply and demand, a Query Mover's Distance (QMD) framework for ranking queries is used, which formulates QAC as an optimal transport problem balancing product demand and supply.

Abstract: Data storage and calling methods and devices are provided. One of the methods includes: receiving first motion data and business data; establishing an association relationship between the first motion data and the business data and storing the association relationship; receiving second motion data; and determining first motion data that matches the second motion data, and returning, to a sender of the second motion data, business data associated with the matched first motion data.

Abstract: In one example, a method involves performing an initial discovery process that includes querying a storage array, and identifying, based on the query, one or more hosts that are registered with the storage array. This initial discovery process is performed automatically without requiring user action to identify the one or more hosts. The method additionally includes presenting a list of discovered hosts, receiving a selection input from a user specifying one or more of the hosts in the list, retrieving, from the storage array, information associated with each of the respective hosts, and making the information available to a user.

Abstract: Embodiments of the present disclosure provide a method, an electronic device and a computer program product for data processing. In one embodiment, the method includes determining, at a first node in a network, one or more nodes in the network storing replicas of target data based on a hash value associated with the target data in the network. The method further includes executing replica maintenance for the target data, which includes determining the number of available nodes in the one or more nodes comparing a number of the available nodes with the predetermined number of replicas of the target data in the network and in response to the number of the available nodes being different than the predetermined number, changing storage distribution of replicas of the target data in the network.

Abstract: The present invention relates to a method for an electronic device displaying search information. The method comprises the steps of: transmitting a query with respect to a displayed page; and displaying search information that matches with content included in the page, wherein the step of transmitting a query is characterised by transmitting the query including one or more of a record log of a web browser executing the page, data extracted from the record log, data that is extracted from the page and that can be uploaded, and a screenshot of the page.

Abstract: Methods and systems for using machine learning to determine electronic document similarity include extracting entities and corresponding relationships from each of two electronic documents of a corpus of electronic documents based on word embedding, computing an entity distance between the extracted entities and a relationship distance between the extracted relationships based on knowledge graph embedding, combining the entity and relationship distances to generate a similarity score between the electronic documents, and implementing the similarity score to perform a task associated with the electronic documents.

Abstract: Embodiments herein discloses a method for competency information management. The method includes receiving an input topic. Further, the method includes causing by the competency profile manager to display a graphical element comprising at least one knowledge cluster of interconnected skills corresponding to the input topic, wherein the at least one knowledge cluster of interconnected skills are dynamically determined from a cluster-based knowledge repository based on a plurality of competency parameters. Furthermore, the method includes generating by the competency profile manager a competency profile by combining the input topic with at least one skill selected from the plurality of interconnected skills and storing the competency profile.

Abstract: Techniques for processing a natural language query are provided. The techniques include obtaining a set of statistics representing a contextual significance of a set of words in a data model for a data set. Next, the set of statistics is used to match a set of semantic intents for a natural language query of the data set to one or more data elements in the data model. The data element(s) and the data set are then to generate a result of the natural language query, and the result is provided in a response to the natural language query.

Abstract: Techniques for generating interest embedding vectors are disclosed. In some embodiments, a system/process/computer program product for generating interest embedding vectors includes aggregating a plurality of web documents associated with one or more entities, wherein the web documents are retrieved from a plurality of online content sources including one or more websites; selecting a plurality of tokens based on processing of the plurality of web documents; and generating embeddings of the selected tokens in an embedding space.

Abstract: A technology is provided for conflict resolution in a data proxy for a mutation. A mutation may be received at a data proxy from an application, and the data proxy is in a service provider environment. The mutation may be sent to be processed by a data store via a data access resolver. A conflict message may be received at the data proxy via the data access resolver for a conflict mutation at the data store for the mutation. The conflict may be resolved at the data proxy using a conflict resolution function in the data proxy.

Abstract: In various examples, there is provided a computer-implemented method for writing transaction log entries to a transaction log for a database system. At least part of the database system is configured to be executed within a trusted execution environment. The transaction log is stored outside of the trusted execution environment. The method maintains a first secure count representing a number of transaction log entries which have been written to the transaction log for transactions which have been committed to the database and writes a transaction log entry to the transaction log. In other examples, there is also provided is a computer-implemented method for restoring a database system using transaction log entries received from the transaction log and a current value of the first secure count.