International Business Machines Corporation

Oracle International Corporation

Sriram Raghavan

Huaiyu Zhu

Shivakumar Vaithyanathan

Yunyao Li

Rajasekar Krishnamurthy

Himanshu Gupta

Monu Kedia

Adriano Crestani Campos

Rahul Gupta

Prasad Manikarao Deshpande

Anindya Neogi

Dinesh Garg

David Mun-Hien Choy

Rose Catherine Kanjirathinkal

Narendran Sachindran

Krishna Prasad Chitrapura

Jennifer Lee Beckmann

Mukesh Kumar Mohania

Sriram Kolinjivadi Padmanabhan

Blake T Sullivan

Hui-I Hsiao

Sanjeev K Gupta

Rajeev Gupta

Gargi Banerjee Dasgupta

Manish Sethi

Deepak S Padmanabhan

Vishal Singh Batra

Atri Mandal

Venkateswara Reddy Madduri

Sriram Lakshminarasimhan

Animesh Nandi

Suriya Subramanian

Aditya Telang

Ganesh Vaideeswaran

Bhupesh S Chawda

Sai Dattathrani

Alexander Stephan Loeser

Prasad M Deshpande

Sayan Ranu

Ganesha Beedubail

Arun Dobriyal

Rajasekar Krishmamurthy

Methods and arrangements for efficiently mining a control flow graph from execution logs of a distributed system. Using at least one text clustering technique, two text clusters are generated from the plurality of execution logs. At least one approximate template is generated based on the at least two text clusters. At least one refined template is created via refining the at least one approximate template using multimodal sequencing. The control flow graph is created based on the at least one refined template. An anomaly is detected in the control flow graph.

Scalable and accurate mining of control flow from execution logs across distributed systems

Methods and arrangements for managing map-reduce jobs. There are identified intermediate data produced, in a current map-reduce cycle, by a plurality of nodes in the distributed network, the nodes being selected from the group consisting of: a plurality of map nodes, and a plurality of reducer nodes. There are identified a plurality of classes of data, for classifying the intermediate data. Discrete portions of the intermediate data are classified into respective ones of the classes of data, wherein at least one of the classes of data comprises intermediate data which are processed in a map-reduce cycle subsequent to the current map-reduce cycle. Other variants and embodiments are broadly contemplated herein.

Extending a map-reduce framework to improve efficiency of multi-cycle map-reduce jobs

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.

Collaborative analytics with edge devices

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.

Processing multi-way theta join queries involving arithmetic operators on MapReduce

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.

Computing a similarity measure over moving object trajectories

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.

Providing search query results based on entity variant generation and normalization

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.

Automatic log record segmentation

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.

System and a method for hierarchical data column storage and efficient query processing

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.

Accelerated regular expression evaluation using positional information

Embodiments of the present invention provide an efficient and scalable scheme for role-based access control to resources. The resources are assigned a protection class. Resources in the same protection class share the same access control policy. Permissions granted to various roles are then defined based on privilege sets and protection classes. Accordingly, the permissions of a role can be dynamically determined at runtime. Furthermore, as new resources are added, they can be assigned to a pre-existing protection class. The new resource may thus automatically inherit the various permissions and roles attached to the protection class.

System and method for role based access control in a content management system

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.

Learning rewrite rules for search database systems using query logs

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.

Leveraging social media to assist in troubleshooting

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.

Persisting and retrieving arbitrary slices of nested structures using a column-oriented data store

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.

Action performed indicators for menu items

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.

Growing community of inventors

Bengaluru, India

Sriram Raghavan