Abstract: A digital magazine server receives user comments on content items of a digital magazine and generates comment threads. A comment thread has one or more user comments associated with a content item and at least one topic. A topic thread on a selected topic includes one or more comment threads related to the selected topic. To select comment threads for a topic thread based on the selected topic, the digital magazine server determines the relevance of the topic of each comment thread to the topic of the topic thread and determines the quality of the comment thread based on a plurality of quality factors such as number of comments and timestamps of the comments in a comment thread. The digital magazine server aggregates the comment threads based on at least one of topic relevance determination and thread quality determination and selects comment threads based on the aggregation.

Abstract: Methods, systems, and computer-readable media for distributed transactions across multiple consensus groups are disclosed. A distributed transaction system comprises a proposer and a plurality of consensus groups, including a first consensus group comprising a first plurality of members and a second consensus group comprising a second plurality of members. The proposer proposes a transaction to at least a portion of the first consensus group and at least a portion of the second consensus group. A majority of the members in the first consensus group agree to perform the transaction, where the transaction is selected from a plurality of proposed transactions involving the first consensus group. A majority of the members in the second consensus group also agree to perform the transaction. The members of the first and second consensus groups perform the transaction to update a plurality of stored replicas.

Abstract: In one embodiment, a method includes accessing a plurality of communications, each communication being associated with a particular content item and including a text of the communication; extracting, for each of the communications, n-grams from the text of the communication; identifying mention-terms from the extracted n-grams, each mention-term being a noun-phrase; calculating a term-score for each mention-term based on a frequency of occurrence of the mention-term in the communications; and generating a mentions-module including mentions, each mention including a mention-term having a term-score greater than a threshold term-score and text from communications comprising the mention-term.

Abstract: Methods, systems and apparatus, including computer programs encoded on a computer storage medium for selecting keywords for resources are disclosed. In one aspect, a search query is received associated with a first user. A determination is made that the first user is a follower of an entity feed that is provided by a first entity and that is provided through a social network. A content item is selected having distribution parameters specifying that the content item is to be provided to users that are followers of the entity feed and that submit the search query. The selected content item is provided for the first user.

Abstract: A computer-implemented method for searching for a ticket relevant to a current ticket describing an incident, a system and a computer program product for the same. The method includes extracting a topology of a first application of a server system, the first application being indicated by the current ticket; selecting a second application relevant to the first application from a plurality of candidate applications of the server system, according to the topology; and searching tickets associated with the second application for the ticket relevant to the current ticket.

Abstract: A health care information system, method and computer program product are provided to transform health care data in an efficient manner. In the context of a health care information system, the health care information system includes processing circuitry configured to define a transformation pipeline that includes a plurality of ordered transform elements. The processing circuitry is also configured to ingest health care data with the transformation pipeline in order to transform the health care data. The processing circuitry is further configured to track propagation of data representative of or associated with the health care data through the transformation pipeline. The processing circuitry is configured to track the propagation by identifying one or more completed transform elements that have completed processing of the data and by also identifying one or more ongoing transform elements that have begun processing of the data but for which the processing is incomplete.

Abstract: A method of bootstrap sampling a dataset is described. With a process node, a series of random integers is generated. An assignment map is created. The assignment map includes a row identifier for each row of data of the dataset. A plurality of bootstrap sample identifiers defined by the series are assigned to at least one row identifier. An output table created from the assignment map. Rows of the output table include each instance of the bootstrap sample identifiers, the row identifier assigned with the bootstrap sample identifier, and data of the row.

Abstract: In one embodiment, a method includes receiving, from a client system of a first user, a request associated with a particular content item; identifying communications authored by one or more users, each identified communication being associated with the particular content item; generating one or more search-results modules related to the particular content item, each search-results module being of a particular module type, wherein each search-results module includes information from a subset of the identified communications, the information corresponding to the particular module type of the search-results module, and wherein a number of communications in the subset of the identified communications including each search-results module is greater than a module-specific threshold number of communications; and sending, to the client system, a search-results interface comprising one or more of the search-results modules.

Abstract: According to an aspect, a system for assisting a user with configuration management may include a configuration management database (CMDB) system having a plurality of configuration items, and an application external to the CMDB system. The CMDB system may associate an invocation string with a first configuration item and the application external to the CMDB system. The CMDB system may obtain information from the first configuration item, where the information from the first configuration item provides information for launching the application external to the CMDB system. The CMDB system may insert the information from the first configuration item into the invocation string to create an application execution command. The CMDB system may execute the application external to the CMDB system, independently from the CMDB system, based on the application execution command.

Abstract: An event tap associated with a server, such as a Web server, at a machine can transform a server event into a tuple, select a database node for the tuple, and place the tuple in a queue for that database node, and then flush the queue periodically directly into database notes. The use of an event tap can thus reduce the computational burden on the database while keeping the server event data in the database relatively fresh.

Abstract: Embodiments of the present invention provide a method, computer program product, and computer system for masking indexes. The method may include masking the index if the index contention exceeds a defined threshold. The method may also include configuring the mask type for the index to insert the index without masking. In response to determining that the mask type for the index is configured to insert the index without masking, the index is masked according to a set of rules.

Abstract: In one embodiment, a method includes accessing a plurality of communications, each communication being associated with a particular content item and including a text of the communication; calculating, for each of the communications, sentiment-scores corresponding to sentiments, wherein each sentiment-score is based on a degree to which n-grams of the text of the communication match sentiment-words associated with the sentiments; determining, for each of the communications, an overall sentiment for the communication based on the calculated sentiment-scores for the communication; calculating sentiment levels for the particular content item corresponding sentiments, each sentiment level being based on a total number of communications determined to have the overall sentiment of the sentiment level; and generating a sentiments-module including sentiment-representations corresponding to overall sentiments having sentiment levels greater than a threshold sentiment level.

Abstract: A data warehouse is constructed using the relational mapping of a transactional database without reconstructing the data relationships of the transactional database. First, an application programmer analyzes an object model in order to describe facts and dimensions using the objects, attributes, and paths of the object model. Each of the dimensions has an identifier that correlates an item in the transactional database to a dimension record in the data warehouse. The fact and dimension descriptions are saved to a description file. Second, a Data Warehouse Engine (DWE) then access the description file and uses the object model, fact and dimension descriptions, and object-relational mapping to map transactional data to the data warehouse.

Abstract: In an embodiment of the present invention, a command for performing a database operation with respect to a table of a database is received, whereby the table has a visible key column for identification information and one or more invisible token columns for token information. The user's role from the command is obtained. A record is identified in the table based on a combination of the identification information and the token information corresponding to the user's role. The database operation is performed on the identified record.

Abstract: An approach is provided for processing status information for one or more points of interest to determine the changes for generation of various representations for presenting in a user interface. The approach involves processing and/or facilitating a processing of status information associated with one or more points of interest to determine one or more point-of-interest changes. The approach also involves causing, at least in part, a generation of one or more representations of the one or more point-of-interest changes, one or more transitions between the one or more point-of-interest changes, or a combination thereof. The approach further involves causing, at least in part, a presentation of the one or more representations in at least one point-of-interest user interface.

Abstract: An information processor includes a dividing part and a providing part. The dividing part divides a series of data pieces identified by an identification information piece into multiple data pieces identified by respective different identification information pieces. The providing part provides, based on the number of digits of a total number of the multiple data pieces, each of the multiple data pieces resulting from the division by the dividing part with a corresponding one of the identification information pieces, the corresponding one identification information piece including a code having digits the number of which is equal to or larger than the number of digits of the total number of the multiple data pieces and indicating an order of placement of the data piece in the series of data pieces.

Abstract: An online social networking system can be used to rank social network objects of various different object types, each according to its type. The objects may comprise types such as users, communities, blogs, blog entries, events, forums, forum topics, postings, photographs, and/or images. The product comprises code for carrying out a method that begins with receiving ranking data about social network objects that comprises data about events performed on the social network. For each social network object, a ranking function is applied to ranking data about the social network object based on its type. In addition, the recency of an event on the social network related to the social network object is evaluated, in order to calculate the score for the social network object. A relative ranking for each of the plurality of social network objects based on its score is determined, and the score and relative ranking of each of the social network objects stored.

Abstract: A method of importing data from a plurality of databases of various types. The method comprises aggregating data from the plurality of databases to a centralized database without copying data to outside the memory of the plurality of databases and the centralized database based on a predefined period of time, and importing the aggregated data from the plurality of databases, wherein data is translated from schemas of the plurality of databases to a universal schema of the centralized database. The method further comprises adjusting memory usage of each of the plurality of databases by the centralized database based on a predefined memory threshold for each of the plurality of databases, whereby memory thresholds of the plurality of databases are not exceeded.

Abstract: Access to first data is provided to a first user and to a second user. A specified change is received from the first user. Access to second data generated based on the first user's specified change is provided only to the first user. The first data is updated based on the specified change, in response to a selection by the first user of an option to apply the specified change to the first data. Simultaneous access to the updated first data is provided to the first user and to the second user.

Abstract: A method and apparatus are provided for classifying received network frames (206) by extracting frame header data (e.g., n-tuple) which is combined with a key insert value (e.g., embedded prefix value “OP01, OP02, . . . OP0OP1”) to generate a lookup key (216), where the key insert value is generated by decoding a key composition rule (235) to extract a constant value (OP0) and a repeat value (OP1), and then replicating the constant value one or more times specified by the repeat value.