Abstract: Systems and methods of providing composite search results are disclosed. A search query may be received by a general purpose search engine of a first website from a user. At least one general purpose search result may be determined based on the search query using the general purpose search engine. The at least one general purpose search result may be based on a search of multiple websites. Item listing information of an item listed for sale on a second website may be determined based on the search query. The at least one general purpose search result and the item listing information may be caused to be displayed concurrently on the first website to the user. The user may be enabled to interact with the second website regarding the item by interacting with the item listing information displayed on the first website.

Abstract: The invention relates to computer-implemented method for supplementing a data governance framework with one or more new data governance technical rules. The method comprises providing a plurality of expressions and a first mapping. The expressions assign natural language patterns to technical language patterns. The first mapping maps first terms to data sources. A rule generator receives a new natural language (NL) rule comprising one or more natural-language patterns and one or more first terms. The rule generator resolves the new NL rule into one or more new technical rules interpretable by a respective rule engine and stores the one or more technical rules in a rule repository.

Abstract: Apparatus, systems, processes, and computer-readable mediums for organizing, facilitating, monitoring, and obtaining feedback for social fitness events are provided. For at least one embodiment, a system includes an events module, configured to interface with a remote events database including one or more event records; a person module configured to interface with a local first database including two or more first records, wherein each of the two or more first records identify each of two or more persons; a devices module configured to interface with a local second database including at least one second record, wherein each of the at least one second records identifies a device communicatively coupled to the processor using an IoT tag; a services module configured to interface with a remote third database including at least one third record; and a facilities module configured to interface with a remote fourth database including at least one fourth record.

Abstract: Analyzing large datasets requires prioritization of analytical calculations to reduce analysis time and resource requirements. The prioritization process includes determining characteristics of a dataset, determining a list of analytical calculations, prioritizing the list of analytical calculations based on the dataset characteristics and characteristics of the analytical calculations, selecting the highest ranked analytical calculation, and applying the selected calculation on the dataset. The prioritization process of a new calculation based on a known set of calculations includes ranking the set of calculations based on their result scores from execution on a given dataset, comparing the new calculation to the list of known set of calculation, determining a similar calculation, and assigning the rank of the similar calculation to the new calculation.

Abstract: Techniques a provided for communication graph tracking in multi system operation in heterogeneous database systems, including retrieving two or more database commit logs from two or more corresponding heterogeneous databases. For each of the commit logs, a subset of information is extracted, including a correlation identifier, and event stream entries are produced based on that information and are stored. The event stream entries are then retrieved and event database entries are created based on the event stream entries. A request for a communication graph related to a particular correlation identifier is received and the event database is searched for matching entries. Those entries are used to generate a displayable communication graph for the particular correlation identifier, which is then provided in response to the request.

Abstract: A method and system for deleting a node of a knowledge graph may be provided. The method comprises receiving knowledge graph data comprising nodes and edges, determining a first relevance degree value for a node and a second relevance degree value for the node, combining the first and the second relevance degree value and marking the node as deletable if the final relevance degree value is above a predefined relevance threshold value. The method comprises further applying queries against the knowledge graph, wherein at least a certain number of such queries invokes accessing of a node, marked as deletable, revising at least one of the first and second relevance degree value based on the accessing of the node marked as deletable, and deleting the node, marked as deletable, if over a predetermined period of time queries against the knowledge graph invoke no access of the node marked as deletable.

Abstract: Methods and systems are disclosed where an FPGA offloads a plurality of processing tasks from a processor. The FPGA can process streaming data received via a network interface, and the FPGA can be controllable in response to control instructions received from the processor. The FPGA comprises resident hardware logic for a plurality of data processing engines that are combinable as a processing pipeline within the FPGA. In response to the control instructions, the FPGA can control which of the data processing engines are activated and which of the data processing engines are deactivated to selectively tap into the streaming data to perform pipelined processing operations on the streaming data via the activated data processing engines. The deactivated data processing engines remain on the FPGA and provide a pass through path for the streaming data whereby the deactivated data processing engines do not perform processing operations on streaming data received thereby.

Abstract: Profiling data includes accessing multiple collections of records to store quantitative information for each particular collection including, for at least one selected field of the records in the particular collection, a corresponding list of value count entries, each including a value appearing in the selected field and a count of the number of records in which the value appears. Processing the quantitative information of two or more collections includes: merging the value count entries of corresponding lists for at least one field from each of a first collection and a second collection to generate a combined list of value count entries, and aggregating value count entries of the combined list of value count entries to generate a list of distinct field value entries identifying a distinct value and including information quantifying a number of records in which the distinct value appears for each of the two or more collections.

Abstract: The described technology is directed towards returning less data than is available for a data item in response to a request to a data service. A virtual graph node is returned in response to client requests, in which the virtual node comprises a relatively lightweight set of information relative to the full set of information for the data item, e.g., maintained in a main (graph) node. A requesting client indicates that a virtual node is desired, and receives a response comprising the virtual node, generally processed from the main node's data into a reduced subset of the main node. The main node may be cached at the data service, and returned if and when requested.

Abstract: The present invention relates to a user recommendation method and system in SNS community and a computer storage medium. The method includes following steps: obtaining an interaction record between a first user and a second user in a first community; generating an interaction frequency of the first user and the second user according to the interaction record; calculating familiarity of the first user and the second user according to the interaction frequency; recommending the second user whose familiarity with the first user exceeds a threshold to the first user in a second community. The method and system and computer storage medium calculate familiarity between users in other community, recommend other users to the user in current community according to familiarity, expand information sources used for determining which users are persons user may possibly know, thereby obtaining more persons user may possibly know and improving efficiency of expanding user relationship circle.

Abstract: A computer implemented method of developing computer applications, the method comprising providing to multiple users access, over a network, to information on a data center, with a subgroup of the users having access to a sub-portion of the information that is different from the sub-portion accessible by the remaining tenants of the subgroup; and communicating wide the data center over the network employing a computer system associated with a user of the sub-group to establish application functionality with the sub-portion that may be accessed, over the network, by additional parties authorized by the user. Also disclosed is a machine-readable medium and a data center, both of which facilitate carrying-out the steps of the method.

Abstract: A method including identifying an emotion identifier from a message using an emotion identifier table is provided. The method includes separating emotion identifier from the message, splitting a portion into multiple tokens delimited by a space or a punctuation mark, and determining a score for the message based on an emotion score in the emotion identifier table, and on at least one of the multiple tokens. The method includes adding a token from the multiple tokens to the emotion identifier table based on a contribution from the token to the message score, associating a sentiment score for the token in the emotion identifier table based on the contribution of the token to the message score, and modifying an emotion score of the token when the token is already included in the emotion identifier table based on the contribution of the token to the message sentiment score.

Abstract: Techniques are described herein for introducing transcode operators into a generated operator tree during query processing. Setting up the transcode operators with correct encoding type at runtime is performed by inferring correct encoding type information during compile time. The inference of the correct encoding type information occurs in three phases during compile time: the first phase involves collecting, consolidating, and propagating the encoding-type information of input columns up the expression tree. The second phase involves pushing the encoding-type information down the tree for nodes in the expression tree that do not yet have any encoding-type assigned. The third phase involves determining which inputs to the current relational operator need to be pre-processed by a transcode operator.

Abstract: The present disclosure relates to systems and methods that require no data redistribution during a database scaling process. Requiring no data redistribution (also called data migration) can save many hours, or days, or even weeks of overhead during database scaling process. Embodiments of the present disclosure disclose only exchanging control messages among database servers. The control messages may include system configuration information, network topology information, database and table structure information, and any other kind of meta-data information. In the said embodiments, database servers are grouped into clusters. A database server may be a physical computer or a virtual server. Data stored in the existing database servers is not migrated to the new servers. When new database servers are added to the distributed database system, a new cluster is formed to include the new servers.

Abstract: A terminal device according to an embodiment of the present invention includes: a display output unit configured to be implemented by a programmed processor, the display output unit that outputs a first area into which a first key data is enterable through a user's operation, a second area into which a second key data is enterable through the user's operation, a third area into which a third key data is enterable through the user's operation, a fourth area into which a fourth key data is enterable through the user's operation, a fifth area into which a fifth key data is enterable through the user's operation, and a sixth area formed by the second area and the third area crossing each other; and a transmitting unit configured to be implemented by a programmed processor.

Abstract: Identifying unvisited portions of visited information to visit includes receiving information to crawl, wherein the information is representative of one of web based information and non-web based information, computing a locality sensitive hash (LSH) value for the received information, and identifying a most similar information visited thus far. Identifying unvisited portions of visited information further includes determining whether the LSH of the received information is equivalent to most similar information visited thus far and, responsive to a determination that the LSH of the received information is not equivalent to most similar information visited thus far, identifying a visited portion of the received information using information for most similar information visited thus far and crawling only unvisited portions of the received information.

Abstract: A method of processing a database can include comparing, using a processor, a delta file with a risk assessment criterion, wherein the delta file is generated from a first schema and a second and different schema, assigning a risk level to a change specified within the delta file according to the comparing, and applying the change of the delta file to a test database conforming to the first schema according to the assigned risk level.

Abstract: The present disclosure is directed to associating computing devices with each other based on computer network activity for selection of content items as part of an online content item placement campaign. A first linking factor is identified based on a connection between a first device and the computer network via a first IP address during a first time period, and based on a connection between a second device and the computer network via the first IP address during the first time period. A number of devices that connect with the computer network via the first IP address is determined. A positive match probability is generated. A second and third linking factors are monitored. A negative match probability is determined based on the second and third linking factors. The first device is linked with the second device based on the positive and negative match probabilities.

Abstract: The present disclosure is directed to associating computing devices with each other based on computer network activity for selection of content items as part of an online content item placement campaign. A first linking factor is identified based on a connection between a first device and the computer network via a first IP address during a first time period, and based on a connection between a second device and the computer network via the first IP address during the first time period. A number of devices that connect with the computer network via the first IP address is determined. A positive match probability is generated. A second and third linking factors are monitored. A negative match probability is determined based on the second and third linking factors. The first device is linked with the second device based on the positive and negative match probabilities.

Abstract: Embodiments are directed towards previewing results generated from indexing data raw data before the corresponding index data is added to an index store. Raw data may be received from a preview data source. After an initial set of configuration information may be established, the preview data may be submitted to an index processing pipeline. A previewing application may generate preview results based on the preview index data and the configuration information. The preview results may enable previewing how the data is being processed by the indexing application. If the preview results are not acceptable, the configuration information may be modified. The preview application enables modification of the configuration information until the generated preview results may be acceptable. If the configuration information is acceptable, the preview data may be processed and indexed in one or more index stores.