Abstract: Methods and arrangements for conducting a search using query logs. A query log is consulted and query rewrite rules are learned automatically based on data in the query log. The learning includes obtaining click-through data present in the query log.

Abstract: Methods, systems, and computer program products for processing multi-way theta join queries involving arithmetic operators on MapReduce are provided herein. A method includes converting (i) a multi-way theta join query into a multi-way interval join query, and (ii) one or more items of data associated with the multi-way theta join query to one or more items of interval data; executing the multi-way interval join query on the one or more items of interval data via MapReduce to generate an output, wherein the output comprises a set of multiple responses to the multi-way interval join query; and processing the output to generate a solution to the multi-way theta join query, wherein said processing comprises discarding each response from the set that does not satisfy the multi-way theta join query.

Abstract: Methods, systems, and articles of manufacture for leveraging social media to assist in troubleshooting are provided herein. A method includes extracting user-generated information pertaining to multiple failure scenarios from at least one social media data source; determining one or more causality relationships between a set of log entries associated with the multiple failure scenarios and the extracted user-generated information; identifying a similarity between the one or more determined causality relationships and information contained within a user query; and providing guidance to the user regarding resolving and/or obviating a failure associated with the user query based on said identified similarity.

Abstract: Methods and arrangements for storing and retrieving nested structures. A nested structure is obtained. There are created slices containing arbitrary sub-structures of the nested structure. The content of slices is stored in one or more columns of a column-oriented data store. At least one access plan for accessing slices in the data store is developed, to be used when a projection query is received. The access plan is executed to construct a nested structure that answers the projection query. Other variants and embodiments are broadly contemplated herein.

Abstract: Methods and arrangements for segmenting log records. A log file is received. Candidates for a sequential pattern within the log file are automatically discerned, and, for each candidate, a likelihood is estimated that it represents a boundary within the log file. Other variants and embodiments are broadly contemplated herein.

Abstract: Search results are provided for a search query. A search query including an entity and entity type is received. The entity is parsed into semantic components. Variants are generated based on input from auxiliary information and user configuration information for each of the semantic components. The entity is recomposed in different morphological forms from different variants of the semantic components. At least one morphological form for the entity is presented as a search result.

Abstract: In various embodiments, one or more visual elements are introduced with menu item that indicate that action on this item has already been performed at least once. In various aspects, a distinctive icon can be placed with a menu item to indicate that a search field has been previously added to a search form, that a column has been added to a report, or that existing data or queries under construction have been modified by the action on an indicated item.

Abstract: Determining variants of a text entity comprises parsing the text entity into semantic components and generating variants for each of the semantic components. The entity is recomposed in different morphological forms from the different variants of the semantic components.

Abstract: A method is provided for determining problem resolutions within a networked computing environment. The method includes retrieving, by one or more computer processors, event data from within a networked computing environment. The method includes determining, by the one or more computer processors, a characteristic of a database within the networked computing environment, the database storing a plurality of problem resolutions. The method includes determining, by the one or more computer processors, a search query corresponding to the event data and to the characteristic of the database. The method includes performing, by the one or more computer processors, a first search of the database using the search query and then refining, by the one or more computer processors, the search query. The method then includes performing, by the one or more computer processors, at least one additional search of the database using the refined search query.

Abstract: Methods, systems, and articles of manufacture for leveraging social media to assist in troubleshooting are provided herein. A method includes extracting user-generated information pertaining to multiple failure scenarios from at least one social media data source; determining one or more causality relationships between a set of log entries associated with the multiple failure scenarios and the extracted user-generated information; identifying a similarity between the one or more determined causality relationships and information contained within a user query; and providing guidance to the user regarding resolving and/or obviating a failure associated with the user query based on said identified similarity.

Abstract: A method is provided for determining problem resolutions within a networked computing environment. The method includes retrieving, by one or more computer processors, event data from within a networked computing environment. The method includes determining, by the one or more computer processors, a characteristic of a database within the networked computing environment, the database storing a plurality of problem resolutions. The method includes determining, by the one or more computer processors, a search query corresponding to the event data and to the characteristic of the database. The method includes performing, by the one or more computer processors, a first search of the database using the search query and then refining, by the one or more computer processors, the search query. The method then includes performing, by the one or more computer processors, at least one additional search of the database using the refined search query.

Abstract: Methods and arrangements for conducting a search using query logs. A query log is consulted and query rewrite rules are learned automatically based on data in the query log. The learning includes obtaining click-through data present in the query log.

Abstract: An embodiment provides intermediate data derived in the form of column stores which are in turn based on hierarchical data stores. This intermediate data represents a reduced subset of data matched appropriately to a query (or modified query) such that the amount of data handled in a query processing task on large data is greatly reduced. An embodiment may appropriately choose column data stores and/or modify queries in order leverage parallelization techniques such as map-reduce in order to query large data. The result is the ability to query large data stores in parallel while reducing the amount of data that must be handled.

Abstract: Determining variants of a text entity comprises parsing the text entity into semantic components and generating variants for each of the semantic components. The entity is recomposed in different morphological forms from the different variants of the semantic components.

Abstract: Methods and arrangements for measuring similarity with respect to moving object trajectories. First and second moving object trajectories are input, each trajectory being defined by at least two spatial dimensions and a temporal dimension. At least one segment is defined with respect to each trajectory, each segment being defined between two defining points. At least one segment from the first trajectory is matched with at least one segment from the second trajectory. A spatial distance and temporal distance are each computed between the at least one segment from the first trajectory and the at least one segment from the second trajectory. The spatial distance and temporal distance are combined to provide a measure of a spatio-temporal distance between the at least one segment from the first trajectory and the at least one segment from the second trajectory. Other variants and embodiments are broadly contemplated herein.

Abstract: Techniques, systems, and articles of manufacture for collaborative analytics with edge devices. A method includes identifying multiple items of data pertaining to a user from one or more user actions implemented across multiple user devices, identifying one or more rules associated with one or more user preferences, exchanging the multiple items of data across the multiple user devices, and applying the one or more rules to the multiple items of data across the multiple user devices to generate an output via at least one of the multiple user devices.

Abstract: Methods and arrangements for evaluating a regular expression. Text strings are received. A regular expression is also received, the regular expression comprising a pattern for specifying and recognizing at least one text string from among the received text strings. There is generated, with respect to the received text strings, a data structure containing grams with positional information. The data structure is employed to evaluate the regular expression via identifying a subset of the text strings comprising at least one match for the given regular expression. Other variants and embodiments are broadly contemplated herein.

Abstract: A method and associated systems for the efficient selection of runtime rules for programmable search engines, in which a processor of a computer system translates a set of programmable search-engine runtime rules into a set of fielded documents and then partitions the fielded documents into optimized clusters that are each in turn converted into an inverted index. When a user submits a query, the search engine converts the query into a set of fielded queries and uses the set of inverted indices and the set of fielded queries to identify a candidate subset of the runtime rules. The search engine matches this candidate subset against the input query to select a final set of applicable runtime rules.

Abstract: Methods and arrangements for storing and retrieving nested structures. A nested structure is obtained. There are created slices containing arbitrary sub-structures of the nested structure. The content of slices is stored in one or more columns of a column-oriented data store. At least one access plan for accessing slices in the data store is developed, to be used when a projection query is received. The access plan is executed to construct a nested structure that answers the projection query. Other variants and embodiments are broadly contemplated herein.

Abstract: A method, device, and computer program product are provided for regular expression learning is provided. An initial regular expression may be received from a user. The initial regular expression is executed over a database. Positive matches and negative matches are labeled. The initial regular expression and the labeled positive and negative matches are input in a transformation process. The transformation process may iteratively execute character class restrictions, quantifier restrictions, negative lookaheads on the initial regular expression to transform the initial regular expression into the pool of candidate regular expressions. The transformation process may execute, one at a time, the character class restrictions, quantifier restrictions, the negative lookaheads. A candidate regular expression is selected from the pool of candidate regular expressions, where the selected candidate regular expression has a best F-Measure out of the pool of candidate regular expressions.