Abstract: Methods and computer program products for generating a search query are provided. A method includes receiving a first string of characters inputted into a text input field of a graphical user interface, wherein the first string of characters represents a first portion of the search query. One or more query suggestions based on the first string of characters are displayed within the graphical user interface. The method further includes receiving a selected first query suggestion and displaying it in a first query segment within the text input field. A second string of characters inputted into the text input field of the graphical user interface may also be received. One or more second query suggestions based on the second string of characters may be displayed. A selected second query suggestion may be received from the one or more second query suggestions and then displayed in a second query segment.

Abstract: One or more processors receive a dataset that includes a plurality of nodes. One or more processors identify relationships between a plurality of interacting nodes within the dataset. One or more processors determine relationship strength values between a plurality of interacting node pairs within the dataset. One or more processors generate a graphical representation that represents the relationship strength values between the plurality of interacting nodes within the dataset. Interacting node pairs are connected by edges and the edges have a length that correlates with the relationship strength value between the interacting node pairs.

Abstract: One or more techniques and/or systems are provided for parsing tabular data of a document. That is, a document may comprise arbitrarily formatted content (e.g., an equipment inspection report generated by an engineer). Respective rows of the document may be clustered into one or more row clusters based upon row proximity and/or numeric content (e.g., rows having similar numeric content may comprise logically related information). One or more vertical clusters may be generated within respective row clusters based upon vertical overlap. In this way, row clusters and/or vertical clusters may be searched for one or more values that may be assigned to a search term. For example, a row cluster may comprise a search term “Average temp”. One or more vertical clusters within the row cluster may be searched for a word that matches a pattern criteria (e.g., a two digit number), which may be assigned to the search term.

Abstract: In an approach for semantically translating data. Aspects of an embodiment of the present invention include an approach for semantically translating data, wherein the approach includes a processor selecting a first node. A processor identifies a parent node of the first node. A processor determines that a value of the first node is unknown. A processor responsive to determining that the value of the first node is unknown, annotates the first node to indicate that the first node is at least partially unknown. A processor identifies a common table expression of the first node. A processor determines that the common table expression of the first node matches, within a predetermined threshold, a common table expression of the second node. A processor merges information from the common table expression of the second node with the common table expression of the first node.

Abstract: In an approach for semantically translating data. Aspects of an embodiment of the present invention include an approach for semantically translating data, wherein the approach includes a processor selecting a first node. A processor identifies a parent node of the first node. A processor determines that a value of the first node is unknown. A processor responsive to determining that the value of the first node is unknown, annotates the first node to indicate that the first node is at least partially unknown. A processor identifies a common table expression of the first node. A processor determines that the common table expression of the first node matches, within a predetermined threshold, a common table expression of the second node. A processor merges information from the common table expression of the second node with the common table expression of the first node.

Abstract: One or more processors receive a dataset that includes a plurality of nodes. One or more processors identify relationships between a plurality of interacting nodes within the dataset. One or more processors determine relationship strength values between a plurality of interacting node pairs within the dataset. One or more processors generate a graphical representation that represents the relationship strength values between the plurality of interacting nodes within the dataset. Interacting node pairs are connected by edges and the edges have a length that correlates with the relationship strength value between the interacting node pairs.

Abstract: One or more processors receive a dataset that includes a plurality of nodes. One or more processors identify relationships between a plurality of interacting nodes within the dataset. One or more processors determine relationship strength values between a plurality of interacting node pairs within the dataset. One or more processors generate a graphical representation that represents the relationship strength values between the plurality of interacting nodes within the dataset. Interacting node pairs are connected by edges and the edges have a length that correlates with the relationship strength value between the interacting node pairs.

Abstract: A method of enabling collaboration between users of a collaborative Business Intelligence (BI) system comprising pages based on said BI system data, comprising: displaying a page comprising a view of at least one online analytical processing (OLAP) cube to one of a plurality of users of a BI system; deducing from semantics of said at least one OLAP cube a relevancy of each of at least some of said plurality of users for a collaboration session with said user; selecting the most relevant users from said plurality of users for said displayed page according to said deduced relevancy; and initiating a collaboration session with at least one of said most relevant users.

Abstract: A system and method for managing and storing logically grouped hierarchical data via physical block storage is provided. Logical groups of parsed XML node data forming node ID ranges are indexed by creating and inserting an index entry into a node ID range. Index entries indicate node ID range bounds for blocks in which nodes are stored. Consulting a node ID range index facilitates XML node traversal via logical links between nodes in different blocks. Additionally, physical links between nodes within a block allow for fast node traversal. Node update including insertion and deletion as well as document order based pre-fetch and XML document re-organization is also facilitated by this architecture.

Abstract: Managing healthcare information data includes, on a computer, representing a state of a system based on the healthcare information, receiving a transaction representing a change to the system, changing the representation of the state of the system according to the transaction, and storing the transaction.

Abstract: A method and system for leveraging content is provided. The method includes receiving, data associated with a subscriber and registering the subscriber with an ECM computing system. Devices belonging to the subscriber are connected to the ECM computing system and metadata associated with content retrieved from the devices is generated. The content in the devices are classified into formal content and informal content. Multiple searches for additional content are monitored and multifaceted search results associated with the formal content and the informal content are generated and presented to the subscriber. The subscriber has an option to request informal content on additional end user devices from respective end users based on metadata presented by search results.

Abstract: Disclosed here are methods, systems, paradigms and structures for predicting queries, creating tables to store data for the predicted queries, and selecting a particular table to obtain the data from in response to a query. The methods include determining various combinations of a finite set of columns users may query on, based on (i) a list of columns users are interested in obtaining data for, and (ii) cardinality information of a column or combinations of columns in the list of columns. The methods further includes creating various tables based on the determined combinations of the columns using a meta query language. A query is responded to by selecting a table that has least number of rows, among the tables that satisfy query parameters. The methods include selecting a table that has a longest sequence of columns matching with a portion of the query parameters.

Abstract: Techniques for content recommendation are described. Some embodiments provide a content recommendation system (“CRS”) configured to recommend content items that are related to a collection of entities. A content item may be considered related to a collection of entities based on various factors, including whether and how often the article references or otherwise covers the entities of the collection, the size of the article, other entities that are covered by the article but that are not in the collection, article recency, or article credibility. Recommending content items may also or instead include determining entities that are related to a collection. An entity can be considered related to a collection based on various factors, such as whether the entity is of the same or similar type to entities of the collection, or whether the entity appears in some article in a relationship with one or more entities of the collection.

Abstract: In an approach for semantically translating data. Aspects of an embodiment of the present invention include an approach for semantically translating data, wherein the approach includes a processor selecting a first node. A processor identifies a parent node of the first node. A processor determines that a value of the first node is unknown. A processor responsive to determining that the value of the first node is unknown, annotates the first node to indicate that the first node is at least partially unknown. A processor identifies a common table expression of the first node. A processor determines that the common table expression of the first node matches, within a predetermined threshold, a common table expression of the second node. A processor merges information from the common table expression of the second node with the common table expression of the first node.

Abstract: One or more processors receive a dataset that includes a plurality of nodes. One or more processors identify relationships between a plurality of interacting nodes within the dataset. One or more processors determine relationship strength values between a plurality of interacting node pairs within the dataset. One or more processors generate a graphical representation that represents the relationship strength values between the plurality of interacting nodes within the dataset. Interacting node pairs are connected by edges and the edges have a length that correlates with the relationship strength value between the interacting node pairs.

Abstract: In an example embodiment, previous search queries and clicked-on results are retrieved. This results in one or more pairs, each pair containing a query from the search term database and a first set of search engine results from the click database. Then a score is calculated for each feature within the one or more pairs, and a second set of search queries is boosted using the scores for the features.

Abstract: A method, apparatus, and article of manufacture for optimizing a query in a computer system. Grouping operations are optimized during execution of the query in the computer system by: (1) translating the grouping operations into a plurality of levels, wherein each of the levels is comprised of one or more grouping sets with the same number of grouping expressions; (2) deriving the grouping sets on a level-by-level basis, wherein the grouping sets in a base level are obtained from the database and the grouping sets in a next one of the levels are derived by selecting as an input a smallest one of the grouping sets in a previous one of the levels with which it has a derivation relationship; and (3) combining the derived grouping sets into an output for the query.

Abstract: In an executing database instance including a plurality of database nodes, creation of a backup of the executing database instance includes creation of a current savepoint in one of the plurality of database nodes by storing first modified pages of a cache of the database node in a datastore of the database node, transmitting a confirmation after storing the first modified pages, repeatedly identifying second modified pages of the cache and storing the identified second modified pages in the datastore, receiving an instruction to enter a critical phase and stopping the repeated identifying and storing in response to the instruction, blocking updates to the database node and transmitting a second confirmation, and receiving a second instruction and, in response to receiving the second instruction, identifying third modified pages of the cache and storing the third modified pages of the cache in the datastore.

Abstract: An optimistic, latch-free index traversal (“OLFIT”) concurrency control scheme is disclosed for an index structure for managing a database system. In each node of an index tree, the OLFIT scheme maintains a latch, a version number, and a link to the next node at the same level of the index tree. Index traversal involves consistent node read operations starting from the root. To ensure the consistency of node read operations without latching, every node update operation first obtains a latch and increments the version number after update of the node contents. Every node read operation begins with reading the version number into a register and ends with verifying if the current version number is consistent with the register-stored version number. If they are the same, the read operation is consistent. Otherwise, the node read is retried until the verification succeeds. The concurrency control scheme of the present invention is applicable to many index structures such as the B+-tree and the CSB+-tree.

Abstract: In an optimizer within a Relational Database Management System improved ways in which a search space (the universe of possible join combinations) is generated and managed and improved ways in which the elements of a search space are evaluated so that among other things unpromising elements are efficiently dropped (pruned).