Abstract: Methods, systems, and apparatuses, including computer programs encoded on computer-readable media, for advertisement keyword scoring. A processing circuit receives a request for an advertisement to be provided to a user during a user session. The advertisement is to be provided alongside other content that is associated with a first plurality of keywords. A processing circuit identifies a plurality of advertisements based on the first plurality of keywords. Each of the plurality of advertisements is associated with a second plurality of keywords. The processing circuit calculates a keyword score for each of the second plurality of keywords for each of the plurality of advertisements. Based on the keyword score, one of the keywords for each of the plurality of the plurality of advertisements is selected. Based on a comparison of the selected keywords, the advertisement to be provided to the user is selected.

Abstract: The APPARATUSES, METHODS AND SYSTEMS FOR A GLOBAL DATA EXCHANGE (hereinafter “GDE”) implement efficient and scalable monitoring, regulation, and allocation of computational processing, data, labor, and/or the like resources within an enterprise. In some embodiments, the GDE may provide a plurality of universal variables allocable to tables and/or fields across multiple, otherwise disparate database systems, facilitating integrability and exchange of data therebetween. In some implementations, the universal variables may be selectively chosen for broad applicability to a vast swath of enterprise data types and organizations, and may themselves be organized in accordance with a hierarchical schema facilitating business understanding and decision making. The GDE may further facilitate, in various implementations, report generation, data updating, and cohesion between different enterprise functions, systems, and applications through the use of universal variables and economical interface features.

Abstract: Disclosed are various embodiments for extracting a representative review excerpt from a plurality of reviews associated with an item available for purchase in an electronic commerce system. A review extractor identifies a lexicon appearing in the reviews and associates each of the reviews with at least one category where the categories are based on the identified common lexicon. The review extractor then ranks the categories according to a ranking of attributes specified by consumer preferences. Upon ranking the categories, the review extractor then extracts a representative review excerpt based on a correlation between the number of reviews associated with each category and the ranking of that category as indicated by the consumer preferences.

Abstract: A multiversioned position-space indexing system is disclosed. The system includes data structures for maintaining a multiversioned position space including a multi-versioned filter merge list which represents many versions of a changing position space in a very compact form and a position shift map which describes how to translate stored positions in many different log-structured merge tree layers into logical positions at a particular timestamp. Each log-structured merge tree layer can be divided into two sublayers: a final sublayer and a correction sublayer. The final sublayer contains index entries added after the layer's start timestamp and remain live as of the layer's final timestamp as well as deletion makers for index entries that were inserted before the layer's start timestamp, but deleted before the layer's final timestamp. The correction layer contains index entries that were both created and deleted between the start and end timestamps of the layer.

Abstract: The present invention discloses a method and apparatus for obtaining dynamic information. In the method, a first client of a first user obtains a relationship chain of the first user, wherein the relationship chain of the first user comprises at least one second user; determines an active degree of the at least one second user in a preset first time period, determines a time interval reference value of requesting dynamic information according to the active degree, determines an information updating degree of the at least one second user in a preset second time interval, determining a time interval adjustment value of requesting the dynamic information based on the information updating degree; determines a time interval value according to the time interval reference value and the time interval adjustment value of requesting the dynamic information, and requests the dynamic information of the at least one second user according to the time interval value of requesting the dynamic information.

Abstract: In one aspect, a method includes sending a first short hash handle and a first identity bit associated with the first short hash handle to a replication site, determining if a second hash handle is identical to the first short hash handle, determining if a second identity bit associated with the second short hash handle at the replication is set if the second short hash handle is identical to the first short hash handle and using the second hash handle to identify the data if the second identity bit being is set. The first short hash handle is an identifier of data stored on a disk.

Abstract: This invention is a system for integrating relational databases into a semantic web framework utilizing a simple mapping process and the SQL query optimizer present in the SQL database engine.

Abstract: Embodiments of the invention are directed to systems, methods and computer program products for converting MLOAD and TPUMP operations. In some embodiments, a system is configured to: receive a first information, wherein the first information comprises at least one piece of data; count the number of pieces of data; compare the counted number of pieces of data to a predetermined threshold value; and identify a load utility based on the comparison between the counted number of pieces of data and the predetermined threshold value.

Abstract: A clustered source code management system is described. The system comprises a plurality of cluster nodes, a shared file server storing repository data, and a load balancer. Each of the plurality of cluster nodes is configured to receive an incoming request sent from a client computer, the incoming request being a source code management request to access repository data stored on the shared file server and process the incoming request to determine if a type of the incoming request is a cacheable request type. If the incoming request is of a cacheable request type, the cluster node is configured to determine if a valid cached response to the incoming request is available on storage media locally accessible to the cluster node; and, if so, respond to the incoming request by communicating the valid cached response to the client computer.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for query synonym expansion. One method includes receiving a query including a first compound term, and in response to receiving the query, performing the following operations before search results responsive to the query are identified: generating one or more splits of the first compound term, wherein each split divides the compound term into two or more subterms, assigning a score to each subterm of each split, determining an overall score for each split from the scores for the subterms of the split, selecting one or more of the one or more splits according to the overall score for each split, and augmenting the query with the subterms of each selected split.

Abstract: Example embodiments are provided that may include receiving a request to update a particular object based on a modified object, where the particular object is one of a number of objects in a shared database, and the request includes an identification of one or more referenced objects and version information of the one or more referenced objects. Embodiments further include determining whether any of the referenced objects is stale based on the version information, where the particular object is not updated if any of the referenced objects is stale. More specific embodiments include updating the particular object if none of the referenced objects is stale. In yet further embodiments, determining a referenced object is stale is based on a comparison of a version identifier of the referenced object and a version identifier of an object in the shared database that corresponds to the referenced object.

Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. Metadata objects are stored in a set of regions distributed among the nodes across the array. A given region is identified by hashing a metadata object attribute and extracting a given set of bits of a resulting hash value. A method of managing query results comprises: receiving, by a first node of the plurality of independent nodes from a client application, a request for a list of objects with a criterion; issuing by the first node a query to all the nodes based on the received request; processing the query by each node over the regions in the node using the metadata objects stored in the regions; aggregating and filtering by the first node results of the query from all the nodes; and returning by the first node the aggregated and filtered results to the client application.

Abstract: Systems and methods for routing activity information related to objects in an external application to activity feeds associated with users in a collaboration group are disclosed. When activity information is received, it is routed to collaboration group feeds and user feeds based on a set of routing tables. The routing tables associated objects with events, containers, collaboration groups, and finally users. Based on the routing tables, users who belong to a collaboration groups that are associated with a particular object may see the activity information about that object rendered in an activity feed if the external application grants them permission to access the object. Accordingly, security associated with the object in the external application can be maintained when event information about that object is shared in an activity feed in a collaboration system.

Abstract: Systems and methods for in-memory processing of events are provided. A set of unique elements of a plurality of queries is determined. Each query is executed on a defined schedule and time duration. A plurality of events in an event stream are received. The events are filtered using the set of unique elements. For each query, a query result for each filtered event is determined. For each query, in-memory aggregation of the query result of each filtered event is provided.

Abstract: A method for entity-driven alerts based on disambiguated features, is disclosed. According to an embodiment, disclosed method may refer to entity-driven alerts based on trending or new knowledge of a disambiguated feature. The alerts may be sent to a user when new knowledge is discovered about the disambiguated feature, a new association (such as new features, facts, quotations, or topic IDs related, among others) with the feature of interest, and/or new trending changes are emerging about the feature of interest. According to various embodiments, method for entity-driven alerts based on disambiguated features may reduce the number of false positives resulting in a normal search query. Which in turn, may increase the efficiency of monitoring, allowing for broadened universe of alerts.

Abstract: A data object submitted for storage is analyzed, and a set of values is extracted from the data object that can correspond to a set of attributes. The analysis of the data object can also identify possible new ontology terms. One or more extracted values are presented to the entity which submitted the data object for approval and feedback. This feedback can be used to characterize the data object with appropriate terms, train the extraction process for future extractions, and/or expand the set of known ontology terms.

Abstract: Systems and methods for the categorization of websites are presented. A website is categorized using one or a combination of its domain name and its web page content. The domain name is tokenized, and the tokens compared to categories in a category structure to determine probabilities that the token belongs to each category. Combinations of tokens are similarly compared to the categories. A category may be determined with reference to a vector space in which a training set of websites having known categories is converted according to a methodology into reference vectors containing keyword frequencies. A target website is converted to a target vector using the same methodology, and a distance score of the target vector to each reference vector is calculated. The website represented by the target vector is assigned the category of the reference vector having the lowest distance score.

Abstract: A computer-implemented system and method for providing information tagging in a networked system is disclosed. The apparatus in an example embodiment includes a tag engine configured to process a database of categorized product listings; to receive a user-provided tag associated with at least one of the product listings; to retain the user-provided tag; and to serve the user-provided tag to a user viewing at least one of the product listings.

Abstract: Victim segments to be returned to a free area in a segment cleaning process from a plurality of segments included in each segment group are selected by using a method corresponding to the segment group. A host comprises an interface relaying data exchange with a storage device; and a file system module performing a segment cleaning process by selecting victim segment from a plurality of segments stored in the storage device, discovering live blocks in each of the victim segments, writing back the discovered live blocks to the storage device through the interface, and returning the victim segments to a free area. The file system module calculates victim points for all segments included in a first segment group using a first victim point calculation formula, calculates victim points for all segments included in a second segment group using a second victim point calculation formula, and selects the victim segments based on the victim points.

Abstract: In one embodiment, a method includes accessing a set of queries of an online social network received from one or more users of the online social network, retrieving for each query a number of objects that match at least a portion of the query from one or more data stores associated with the online social network, where each object is associated with a pre-determined static-score based on a static-scoring algorithm, calculating a final-score for each retrieved object based on a final-scoring algorithm, and determining one or more revised static-scores for one or more of the retrieved objects based on a comparison of the final-scores and the static-scores of the retrieved objects.