Abstract: Systems and methods are provided for identifying and compiling information relating to an entity for investigative analysis. The system may comprise one or more processors and a memory storing instructions that, when executed by the one or more processors, cause the system to search, in one or more data sources, with a plurality of known characteristics of an entity to obtain a first plurality of records, identify from the first plurality of records a subset of records that match the known characteristics with a substantial confidence, compile the subset of records to form a unified record representing the entity and conduct a second search with information from the unified record to obtain a second plurality of search results.

Abstract: A method and an apparatus for outputting information are provided. The method includes: acquiring an info-news data set from a target info-news website; determining a field to which each piece of info-news data in the info-news data set belongs; performing, for each field, a cluster analysis on a piece of info-news data belonging to the field in the info-news data set, to obtain a number of the piece of info-news data and a cluster center in each cluster; and using, for each cluster of each field, the cluster center in the cluster as hot info-news of the field, and using the number of the piece of the information belonging to the cluster as an info-news heat degree of the hot info-news and outputting the info-news heat degree.

Abstract: Aspects of the present disclosure relate to systems and methods for providing consumable collaboration insights related to a file in a collaboration environment. In one aspect, data associated with at least one of a file and collaborators of the file is mined. One or more collaboration events related to the file may be determined using the mined data. A summary of the one or more collaboration events related to the file may be generated. The summary of the one or more collaboration events may be sent to a client computing device for displaying a summarized view of the one or more collaboration events as a collaboration pane within the file.

Abstract: A selection device includes an identification unit that identifies search histories related to element candidates that are candidates for a new element, and pieces of posted information on the element candidates. The selection device includes a selection unit that selects, from among the element candidates, an element candidate in order to generate learning data to cause a model to learn a feature of information on the new element based on the identified search histories and the identified pieces of posted information.

Abstract: Embodiments of this application provide a method of distributing information from an allocator terminal to a client terminal over a communication network. Information allocation data in an information allocation system is collected by processing circuitry. The information allocation system is configured to allocate the information to a client terminal. The information allocation data includes data associated with a process of allocating the information. Data of actual effect and estimated effect of allocating the information is calculated according to the information allocation data. An allocation instruction is generated according to a comparison between the actual effect data and the corresponding estimated effect data. The allocation instruction is provided to the allocator terminal.

Abstract: A method of verifying a recording of a live audition is provided that includes creating, by an audition server, an audition token associated with the live audition. The method includes saving a first record of the audition token and sending the audition token to a user device of a performer. The method includes receiving, by the audition server from the user device, the recording of the live audition associated with a received token. The method includes comparing a second record of the received token to the first record and verifying the recording of the live audition when the second record matches the first record. A system for verifying a recording of a live audition is provided. A live audition computer-implemented system is provided that includes an organizer database, a candidate database, and a recording and verification module to verify the recording as a unique trial.

Abstract: Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.

Abstract: Determine first count of first records storing first value in first field, second count of second records storing second value in second field, third count of third records storing third value in third field. Determine count threshold using first, second and third counts, dispersion measure based on dispersion of values stored in second field by first records and other dispersion measure based on other dispersion of values stored in third field by first records. Train machine-learning model to determine dispersion measure threshold based on dispersion and other dispersion measures. If first count is greater than count threshold, and dispersion measure is greater than dispersion measure threshold, create match index based on first and second fields. Receive prospective record storing first value in first field, second value in second field. Use match index to identify record storing first value in first field, second value in second field as matching prospective record.

Abstract: A system for visual discovery is disclosed. The system identifies a visual search query in response to an action associated with an image presented to a user of a client device. The system extracts visual features from the visual search query and compares the visual features with visual features of stored content items. The system then identifies a set of candidate visual content items from the stored content items that have visual features, which are similar to the visual features of the visual search query. The candidate visual content items are ranked using information from a user session and provided for display to the user.

Abstract: Systems, methods, and devices, for managing data skew during a join operation are disclosed. A method includes computing a hash value for a join operation and detecting data skew on a probe side of the join operation at a runtime of the join operation using a lightweight sketch data structure. The method includes identifying a frequent probe-side join key on the probe side of the join operation during a probe phase of the join operation. The method includes identifying a frequent build-side row having a build-side join key corresponding with the frequent probe-side join key. The method includes asynchronously distributing the frequent build-side row to one or more remote servers.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for processing suspect duplicate records in a master data management system. A master data management module identifies two or more suspect duplicate records in the master data management system based on scores. A matching engine classifies the two or more suspect duplicate records, by comparing the scores against threshold values, into one of: a match, a non-match, and a possible match. The master data management module re-classifies the suspect duplicate records and adjusting the threshold values of the matching engine for classification of future records, in response to receiving, by a data stewardship client, a user input indicating an incorrect classification of the suspect duplicate records.

Abstract: One embodiment facilitates data compression. During operation, the system receives, by a host computing device, a request to write a first set of data. The system writes the first set of data to a first storage device of a storage component. A storage component controller performs compression on the first set of data to obtain compressed data. The controller transmits, to a file system component of the host computing device, metadata associated with the compressed data. The file system component inserts in a journal an entry based on the metadata associated with the compressed data. The system writes, by the controller, the compressed data to a second storage device of the storage component, thereby enhancing performance of the host computing device by reducing a number of data transfers involved in compressing and writing of the first set of data.

Abstract: A replica management system facilitates maintaining a distributed and fault-tolerant state for a variable over an Information Centric Network (ICN) by replicating the variable across a set of ICN nodes. During operation, a variable-hosting ICN node can receive an Interest that includes a value-updating command for a replica instance of the variable, current values for a set of replicas of the variable, and a new value for the variable. The ICN node can determine, based on the current values for the set of replica variables, whether the current value for the local replica variable is an authoritative value. If so, the ICN node updates the local replica variable to the new value. However, if the current local value is not the authoritative value, the ICN node rolls back a state of the local replica variable to a previous state, and updates the local replica variable to the new value.

Abstract: Systems, methods, and devices, for managing data skew during a join operation are disclosed. A method includes computing a hash value for a join operation and detecting data skew on a probe side of the join operation at a runtime of the join operation using a lightweight sketch data structure. The method includes identifying a frequent probe-side join key on the probe side of the join operation during a probe phase of the join operation. The method includes identifying a frequent build-side row having a build-side join key corresponding with the frequent probe-side join key. The method includes asynchronously distributing the frequent build-side row to one or more remote servers.

Abstract: A continuous query identified by an archived relation of an application may be received. A physical query plan may be generated for the continuous query and/or a child operator plan may be identified. A buffer operator may be inserted between the child operator and its parent operator and/or the event information from the child operator may be stored in the buffer operator. A query operator may be identified in the physical query plan. It may be determined that the query operator identified in the physical query plan is a same type as a second query operator in a second continuous query concurrently executing. Further, a combined query plan may be generated based at least in part on the query operator identified in the physical query plan being the same type as the second query operator in the second continuous query.

Abstract: According to an embodiment, a data management system includes an index building unit and a searching unit. The index building unit generates a peripheral vector similar to a case example vector representing a feature vector of data to be stored, and builds index information of enabling identification of the case example vector corresponding to the generated peripheral vector. The searching unit refers to the index information in response to a search request in which a query vector representing an arbitrary feature vector is specified, identifies the case example vector corresponding to the peripheral vector that exactly matches with the query vector, and outputs a search result based on the identified case example vector.

Abstract: In some examples, a first node is able to communicate with one or more second nodes for participating in a consensus system. The first node may receive a plurality of pieces of sequential data from a plurality of data sources. The first node may generate a block for a first blockchain that includes a plurality of the pieces of sequential data in the block. Based at least partially on determining that the data source of the last piece of sequential data entered in the block for the first blockchain is different from a data source of the next piece of the sequential data, the first node may generate a block for a second blockchain that includes the next piece of the sequential data, and may further associate an indicator with the block generated for the second blockchain that indicates the block in the first blockchain.

Abstract: An object information processing method includes obtaining an information creation request. The information creation request carries a first address identifier of a target object. The target object includes a subdirectory or a sub-file. The method further includes determining a second address identifier of a parent directory to which the target object belongs according to the first address identifier, searching for an information storage area storing metadata of the parent directory according to the second address identifier, and performing data updating for the information storage area according to the first address identifier to create an association relationship between the parent directory and the target object in the metadata.

Abstract: A data copy method comprises: acquiring, by a destination server, a data block identifier, version information and hole information; transmitting, by the destination server, the data block identifier, the version information and the hole information to a source terminal server so as to enable the source server to find corresponding data according to the data block identifier, the version information and the hole information; receiving, by the destination server, a response message carrying the data transmitted by the source server and copying the data to a hole corresponding to the data block identifier, the version information and the hole according to the response message.

Abstract: Computer-implemented methods, computer-implemented systems, and non-transitory, computer-readable media for processing interaction sequence data are disclosed. One computer-implemented method includes: obtaining a dynamic interaction graph is obtained, where the dynamic interaction graph is constructed based on a dynamic interaction sequence, including a plurality of interactions arranged in a chronological order, where each interaction includes two objects involved in the interaction and a time of the interaction. In the dynamic interaction graph, a sub-graph corresponding to a target node is determined, where nodes in the sub-graph comprise the target node and connection nodes connected to the target node through a predetermined amount of edges originating from the target node. A feature vector corresponding to the target node is determined based on a node feature of each of the nodes of the sub-graph and directions of edges of the sub-graph.