Abstract: An embodiment of the present application provides a user matching method, which includes: receiving first personal information sent by a current user; generating a first candidate peer information list according to the first personal information and providing the first candidate peer information list to the current user for selection; receiving at least one piece of first peer information selected by the current user from the first candidate peer information list; searching for a recommended user according to an information peer exchange principle, wherein the information peer exchange principle comprises that personal information of the recommended user matches with the at least one piece of first peer information selected by the current user, and the first personal information matches with at least one piece of first peer information selected by the recommended user; and providing information of the recommended user to the current user. A user matching apparatus is also provided.

Abstract: Systems and methods for automatically extracting a plurality of contact information from a resource, calculating prominence scores of each contact information, and associating a selected contact information with a content item are provided. A content item and a uniform resource locator are received from a content provider. A resource identified by the uniform resource locator is loaded. A plurality of contact information is detected from the loaded resource. For each of the detected contact information, a prominence score is calculated. One of the plurality of contact information is selected based on the calculated prominence scores. The selected contact information is associated with the content item.

Abstract: Probable origination date may be derived by using a stream of data captured, for example, from the Internet and from other documentation sources such as historical information about a target object, its author, related environmental data, social media data, blogs, microblogs, posts, historical information, and/or other data sources. Techniques such as textual analysis, statistical analytics, and/or artificial intelligence may combine and correlate the information from data sources to extract clues that may indicate the original author and date of authorship. Based on the number of conflicting or validating references, and the relationships between them, a probability or confidence score in the accuracy of the analysis may be generated.

Abstract: Probable origination date may be derived by using a stream of data captured, for example, from the Internet and from other documentation sources such as historical information about a target object, its author, related environmental data, social media data, blogs, microblogs, posts, historical information, and/or other data sources. Techniques such as textual analysis, statistical analytics, and/or artificial intelligence may combine and correlate the information from data sources to extract clues that may indicate the original author and date of authorship. Based on the number of conflicting or validating references, and the relationships between them, a probability or confidence score in the accuracy of the analysis may be generated.

Abstract: A method and a device for selecting data content to be pushed to a terminal are disclosed. In some embodiments, the method includes: acquiring a user identifier, and acquiring a characteristic value, corresponding to the user identifier, in a preset user attribute type; acquiring data content, and searching for a decision tree object corresponding to the data content; locating a leaf node corresponding to the user identifier in the decision tree object based on the characteristic value, corresponding to the user identifier, in the preset user attribute type; and acquiring the number of clicks and the number of pushes stored in the located leaf node, generating a selection reference value based on the number of clicks and the number of pushes, and selecting, based on the selection reference value, data content to be pushed to a terminal corresponding to the user identifier.

Abstract: In column domain dictionary compression, column values in one or more columns are tokenized by a single dictionary. The domain of the dictionary is the entire set of columns. A dictionary may not only map a token to a tokenized value, but also to a count (“token count”) of the number of occurrences of the token and corresponding tokenized value in the dictionary's domain. Such information may be used to compute queries on the base table.

Abstract: Provided is a database system wherein a first node, in accordance with a data transmission request from a second node, transmits, to the second node, specific identification information indicating a transaction log at a predetermined time point, and a transaction log and identification information from after the predetermined time point, and transmits the requested data to the second node from the predetermined time point onwards, and the second node transmits a transmission request for data to the first node in accordance with a search request, and when data received from the first node has been loaded into a memory, the second node executes, on the loaded data, a command relating to a transaction log that is newer than the transaction log indicated by the specific identification information, responds to the search request on the basis of data on which the command has been executed, and deletes the data on which the command has been executed, in accordance with a predetermined condition.

Abstract: Provided is a database system, wherein a first node holds a transaction log of a database together with identification information enabling identification of a sequence of commands, transmits specific identification information indicating a transaction log at a predetermined time point, and the transaction log and identification information from after the predetermined time point, to a second node, and transmits data in the database to the second node from the predetermined time point onwards, and when the data received from the first node has been loaded into a memory, the second node executes a command relating to a transaction log which is newer than the transaction log indicated by the specific identification information, on the loaded data.

Abstract: A computer-implemented method searches a database for a particular string. One or more processors receive data as an input string, and then identify multiple k-grams in, unique characters in, and a length of the input string. The one or more processors perform binary locality sensitive hashing on the k-grams, the unique characters, and the length for the input string, and then sum the binary locality sensitive hashings to create a first addition vector, which is used to generate a first binary vector. The same process is performed on a particular string being requested to generate a second binary vector. The one or more processors then search the database for the particular string that was requested using the second binary vector in a large scale hamming distance query process that determines a hamming distance between the first binary code and the second binary code.

Abstract: In a networked computer system that includes multiple nodes and multiple networks interconnecting the nodes, a database query optimizer takes network choice into consideration when optimizing a query. The query optimizer logs historical information for queries that includes network information. A network monitor determines network characteristics of the multiple networks. The query optimizer then selects a network for a query based on the network characteristics, and optionally based on the historical information as well. The result is a query optimizer that takes network choice into consideration, thereby providing a query that is optimized according to the characteristics of the networks.

Abstract: A hardware and software facility for classifying media content units using keywords from a structured vocabulary. Metadata associated with each media content unit is segmented into a series of descriptive phrases. The descriptive phrases are mapped to keywords in a structured vocabulary, and the identified keywords associated with the media content units. Descriptive phrases that are not found in the structured vocabulary are tracked as candidate phrases for later addition to the structured vocabulary. A keyword index to the media content units may be constructed. The index is used to identify specific media content units that are responsive to search queries in a reliable and accurate fashion.

Abstract: The present disclosure relates to a method, a device and a storage medium for providing data statistics in a computer. The method may include: obtaining a data collection from a server, wherein the data collection comprises a plurality of records, and each of the records comprise a target data field; obtaining an index number of each target data field according to the records respectively; obtaining a bitmap comprising a plurality of bitmap units, each bitmap unit having a unique index number; searching and locating a bitmap unit in the bitmap, and writing a predetermined data into the located bitmap unit, wherein the unique index number of the located bitmap unit corresponds to the index number of each target data field; and determining the bitmap unit having a same data with the predetermined data by traversing the bitmap, and counting a total number of the determined bitmap units.

Abstract: A mechanism is disclosed that enables the invocation of methods of object instances that have persistent data and a mutable key. A mutable key capability is advantageous in a variety of applications, such as monitoring a set of users and their login status on a plurality of media servers (e.g., an email server, an instant messaging server, a voice mail server, a video server, an audio-conferencing server, etc.). The methods that can be invoked include get methods, set methods, unset methods, finder methods, destructors, and business methods. Implementations based on the Enterprise JavaBean specification are disclosed for three illustrative embodiments of the present invention. The illustrative embodiments of the present invention can also be implemented in accordance with object persistence mechanisms other than Enterprise JavaBeans.

Abstract: A mechanism is disclosed that enables garbage collection of object instances that have persistent data and a mutable key. A mutable key capability is advantageous in a variety of applications, such as monitoring a set of users and their login status on a plurality of media servers (e.g., an email server, an instant messaging server, a voice mail server, a video server, an audio-conferencing server, etc.). Implementations based on the Enterprise JavaBean specification are disclosed for three illustrative embodiments of the present invention. The illustrative embodiments of the present invention can also be implemented in accordance with object persistence mechanisms other than Enterprise JavaBeans.

Abstract: Methods and systems for searching a database for a query using an integrated approach of associating transduced query string comparisons with literal query string comparisons reduces computation time and results in more relevant and accurate results. The methods and systems include a processor receiving a query, searching a database for the query, and providing results of the search. The query may be compared to data entries from the database, and a transduced version of the query may be compared to transduced data entries. Results from the comparisons between the query and the data entries may be used to guide the comparisons between the transduced query and the transduced data entries. Search results are determined based on the guided comparisons.

Abstract: A method for providing a context-based service in a communication network includes: at a context server cooperating with the network, receiving a query generated from a service application, indicating that the service application needs to receive from the context server a set of context information when a query condition is fulfilled; at the context server, generating an update rule indicating that a terminal has to transmit the context information to the context server when an update condition is fulfilled; transmitting the update rule from the context server to the terminal; detecting the context information and transmitting them to the terminal; at the terminal, receiving the context information and transmitting them to the context server when the update condition is fulfilled; and at the context server, forwarding the context information to the service application, thus allowing the service application to implement the context-based service.

Abstract: Various embodiments for failure recovery in a computing environment following a data restoration are provided. A catalog locate is performed for each of a plurality of data sets on a base catalog structure (BCS), identifying a plurality of BCS entries. If a first BCS entry is cataloged incorrectly, the first BCS entry is designated to be re-cataloged. The plurality of BCS entries is compared with a plurality of volume table of contents and a plurality of VSAM volume data set (VTOC/VVDS) entries. If a second BCS entry found in the plurality of BCS entries is not found in the plurality of VTOC/VVDS entries, and the second BCS entry indicates that a data set associated with the second BCS entry is located on a volume, an attempt is made to vary on the volume. If the volume cannot be varied on, a request is created to restore the volume.

Abstract: Not all facts in a data warehouse are described by the same set of dimensions. However, there can be associations between the data dimensions and other dimensions. By maintaining a set of relationships that are capable of linking the dimensional keys used in existing data to the keys of an associated dimension, a data transformation can be constructed that summarizes by the original and by the associated dimensions in feeds in an analytical data mart (cube) that includes all the dimensions. This cube can then be consolidated and analyzed in a slice-and-dice fashion as though all the dimensions were independent. Data transformed in this manner can be analyzed alongside data from a source that is keyed by all of the dimensions.

Abstract: A computer system for migrating human resources data from a first human resources data system to a second human resources data system. The computer system may comprise an import utility, a translation utility an export utility and a reports utility. The import utility may be for receiving first employee data from the first human resources system comprising employee attributes and applying an equivalency formula to a first employee attribute of the first data to convert the first employee attribute from a first human resources data system format to a target format. The translation utility may be for applying a translation table to the first data to generate translated data according to the target format; and storing the translated data at the target database. The export utility may be for generating an export file comprising the translated data arranged according to the second human resources data system format.

Abstract: In one embodiment, a set of one or more metadata values may be obtained via a device, where the set of one or more metadata values indicate conditions present with respect to the device, the user of the device, and/or one or more friends of the user. Multiple media items in a plurality of media items may be identified by identifying at least a portion of the plurality of media items based, at least in part, on at least a portion of a second set of one or more metadata values of at least a portion of the plurality of media items and at least a portion of the set of one or more metadata values, where the second set of metadata values indicates conditions present when the corresponding media item was obtained, generated, or identified. A virtual carousel including the multiple media items may be provided.