International Business Machines Corporation

Laurent Sebastien Mignet

Sumit Negi

Daniele Costante Zilio

Sandeep R Patil

Manish Anand Bhide

Sameep Mehta

Abhinay Ravinder Nagpal

Sam Sampson Lightstone

Rajeev Gupta

Gaurav Mehrotra

Jayanta Basak

Sourashis Roy

Pankaj Arora

Guy Maring Lohman

Mukesh Kumar Mohania

Deepak Srinivas Turaga

Mark Francis Wilding

Eric P Bouillet

Anand Ranganathan

Himanshu Gupta

Torsten Steinbach

Raghavendra Singh

Natwar Modani

John Frederick Hornibrook

Vibhore Kumar

Ashwin Srinivasan

Ullas Balan Nambiar

Martin Keller

Tanveer Fathima Mahmood

William R Minor

Kuldeep K Nigam

Swati Shah

Rob Goris

Embodiments of the invention provide data management solutions that go beyond the traditional warehousing system to support advanced analytics. Furthermore, embodiments of the invention relate to systems and methods for extracting data from an existing data warehouse, storing the extracted data in a reusable (intermediate) form using data parallel and compute parallel techniques over cloud, query processing over the data with/without compute parallel techniques, and providing querying using high level querying languages.

System and method for building a cloud aware massive data analytics solution background

A workload specification, detailing specific queries and a frequency of execution of each of the queries, and a set of partitions, are obtained for the database, as inputs. A number of candidate tables are identified for the database, the tables having a plurality of attributes. A chosen attribute is allocated for each of the tables, to obtain a set of tables and a set of appropriate partitions for each of the tables.

System and computer program product for automated design of range partitioned tables for relational databases

A workload specification is obtained for the database. Based on the workload specification, candidate ones of the tables are identified and ranked. Compression impact is evaluated for the candidate ones of the tables. A design for the database is developed, specifying at least one of: (i) which of the tables should be compressed, and (ii) which of the tables should not be compressed.

Method for automated design of row compression on tables in a relational database

A data query instruction for execution is received, wherein execution of the data query instruction is to cause a data transfer into or from a data warehouse. The data warehouse includes data servers that are communicatively coupled for data transfer through a link aggregation group having at least two data links. Responsive to receiving the data query instruction and prior to or at least partially overlapping with execution of the data query instruction to cause the data transfer, which of the number of data servers are to receive or transmit data as part of the data transfer is identified; for each of the identified data servers, a minimum number of the at least two data links that are needed for the data transfer are identified; and if inactive, the minimum number of the at least two data links for each of the identified data servers are activated.

Power management in link aggregation for data transmission

A method includes receiving a data query instruction for execution, wherein execution of the data query instruction is to cause a data transfer into or from a data warehouse. The data warehouse includes data servers that are communicatively coupled for data transfer through a link aggregation group having at least two data links. Responsive to receiving the data query instruction and prior to or at least partially overlapping with execution of the data query instruction to cause the data transfer, the method includes identifying which of the number of data servers are to receive or transmit data as part of the data transfer; identifying, for each of the identified data servers, a minimum number of the at least two data links that are needed for the data transfer; and activating, if inactive, the minimum number of the at least two data links for each of the identified data servers.

A method, system and computer program product for matching an entry of a list to data. The method includes the steps of: generating source code which matches at least a part of said list with said data; compiling said source code into binary code; and determining a match between said list and said data using said compiled binary code wherein at least one of the steps is carried out using a computer device.

Matching an entry of a list to data

To predict edges in a non-cumulative graph, based on a sequence of non-cumulative previous occurrences of the graph, the sequence of non-cumulative previous occurrences of the graph is obtained, and topological properties of each of the previous occurrences of the graph are extracted. Topological similarities between each of the previous occurrences of the graph are computed based on the topological properties. The edges of the graph are predicted by computing a score for each possible edge of the graph, based upon the topological similarities.

System and computer program product to predict edges in a non-cumulative graph

Method to predict edges in a non-cumulative graph

The invention relates to ranking Service Level Agreement violations. A method for ranking said Service Level Agreements comprising determining a set of attributes for Service Level Agreements subject to violation, and predicting importance of Service Level Agreement violations using a model which performs ordinal regression based on said attributes of Service Level Agreements.

Automatically evaluating and ranking service level agreement violations

A method, system, and computer program product for a multi-resolution storage scheme for historical data are provided. The method includes dividing the historical data into a plurality of time frames and determining an amount of compression for each of the time frames, where at least two of the time frames have a different amount of compression. The method further includes applying the amount of compression to each of the time frames, resulting in multi-resolution historical data, and storing the multi-resolution historical data.

Methods, systems, and computer program products for a multi-resolution storage scheme for historical data

A window size for outlier detection in a time series of a database system is determined. Strength values are calculated for data points using a set of window sizes, resulting at least in one set of strength values for each window size. The strength values increase as a distance between a value of a respective data point and a local mean value increases. For each set of strength values, a weighted sum is calculated based on the respective set of strength values. A weighting function is used to suppress the effect of largest strength values and a window size is selected based on the weighted sums.

Determining a window size for outlier detection

Method for automated design of range partitioned tables for relational databases

The invention finds matches in ordered sequences, e.g. program function call stacks from anomalous software program executions for discovering related or identical software flaws and possible known solutions. Call stacks are matched after removing recursive and uninformative subpatterns, e.g. names of common error handling routines, to see if they were generated due to the same possibly known problem. Sequences statistically unlikely to be matches are pruned from the search. Matches found earlier in the sequences may be weighted differently, e.g. to be more important in call stacks, than other matches. Sequences are indexed so that those relevant to a query are identified automatically without detailed exhaustive search. Maximum matches are found by optimizing a cost function based on weighted sequence similarity.

System and method for matching a plurality of ordered sequences with applications to call stack analysis to identify known software problems

Growing community of inventors

New Delhi, India

Laurent Sebastien Mignet