International Business Machines Corporation

Mir Hamid Pirahesh

Roberta Jo Cochrane

Ting Yu Leung

Richard Sefton Sidle

David Everett Simmen

Tuong Chanh Truong

Guy Maring Lohman

Calisto Paul Zuzarte

George Lapis

Vijayshankar Raman

Monica Sachiye Urata

Ronald Jason Barber

Chandrasekaran Mohan

Fatma Ozcan

Eugene Jon Shekita

Yang Sun

Adam J Storm

Bruce Gilbert Lindsay

Ronen Grosman

Yuanyuan Tian

Markos Zaharioudakis

Peter Haas

Berthold Reinwald

Josephine Miu Cheng

Qi Cheng

John Shek-Luen Ng

Linqi Liu

Michelle Meichiou Jou

Yun Yu Wang

Matthew Albert Huras

Saileshwar Krishnamurthy

Christian Marcelo Garcia-Arellano

James C Kleewein

Michael Jeffrey Winer

Jun Rao

David C Sharpe

I-Shin Andy Wang

Robert Neugebauer

Nattavut Sutyanyong

Pinar Tozun

Kuo-Wei Hwang

Jan Vondrak

Tak-Ming Lo

Mohamed Eltabakh

Chin Hsiang Li

Wei Young

John (Yannis) Sismanis

Shu Huar Yeh

Alex Chak-tsang Lui

Serge Philippe Rielau

Mehmet Altinel

Marki Volker

Sam Sampson Lightstone

Kevin Scott Beyer

Christof Bornhoevd

Wen Sun

William Earl Malloy

Yao-Ching Stephen Chen

Naresh K Chainani

Wolfgang Lehner

Andrey Balmin

Donald J Haderle

Frederick Thomas Sharp

Jyh-Herng Chow

Craig Reginald Tomlyn

Brian Thinh-Vinh Tran

Jen-Yao Chung

Michael James Carey

Latha S Colby

Nelson Mendonca Mattos

John A McPherson, Jr

Shivakumar Venkataraman

Sandeep Tata

Raymond Amand Lorie

Wenbin Ma

Patricia G Selinger

Sangeeta T Doraiswamy

Daniel J Coyle, Jr

Navneet Sankara Potti

Nathan Gevaerd Colossi

Marisa S Viveros

Narayana Iyer Subramanian

Avrilia Floratou

Petrus Kai Chung Chan

Themistoklis Palpanas

Quanzhong Li

Gerald Herman Roth

Gene Y Fuh

Sui Jun Tong

Heasoo Hwang

Bennet Vance

Partha Pratim Bhattacharya

Lori G Strain

Mark A Paskin

Narayana Subramanina

Shivkumar Venkataraman

Marc Hörsken

Zografoula Vagena

I-Shin-Andy Wang

One embodiment provides for monotonic transactions in a multi-master database with loosely coupled nodes including performing, by a processor, a read transaction protocol including: performing, by the processor, a read transaction protocol including issuing read transactions at any one of the nodes; attempting to return rows that are known to be replicated by at least a read quorum of the nodes; and for timing-out of the attempting to return rows known to be replicated by at least the read quorum of the nodes based on the special-node being non-responsive: selecting a new special-node from the nodes; and repeating attempting to return rows that are known to be replicated by at least the read quorum of the nodes.

Monotonic transactions in a multi-master database with loosely coupled nodes

A method and system of processing graph query are provided. A graph query is received by a relational database graph module. The graph query is translated into one or more relational database queries. One or more relational database queries are translated to be performed on data stored within a relational database. One or more results from the relational database are received based on the sent one or more relational database queries. A synergistic graph is generated on a display, based on the received one or more results.

Supporting synergistic and retrofittable graph queries inside a relational database

One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Tuple sequence numbers are generated for the records and the records are written on groomed transaction blocks to the table.

Transactional operations in multi-master distributed data management systems

Embodiments of the invention relate to executing graph path queries. A database stores data entities and attributes in node tables and stores links between nodes in an edge table. Edges form a path between a source node and a target node. A source node set is generated and joined with the edge table to produce a first intermediate set. Similarly, a target node set is generated and joined with the edge table to produce a second intermediate set. A result path is generated through a joining of the first and second intermediate paths and application of a length condition.

Executing graph path queries

Embodiments relate to executing graph path queries. A database stores data entities and attributes in node tables and stores links between nodes in an edge table. Edges form a path between a source node and a target node. A source node set is generated and joined with the edge table to produce a first intermediate set. Similarly, a target node set is generated and joined with the edge table to produce a second intermediate set. A result path is generated through a joining of the first and second intermediate paths and application of a length condition.

Embodiments of the present invention relate to elimination of blocks such as splits in distributed processing systems such as MapReduce systems using the Hadoop Distributed Filing System (HDFS). In one embodiment, a method of and computer program product for optimizing queries in distributed processing systems are provided. A query is received. The query includes at least one predicate. The query refers to data. The data includes a plurality of records. Each record comprises a plurality of values in a plurality of attributes. Each record is located in at least one of a plurality of blocks of a distributed file system. Each block has a unique identifier. For each block of the distributed file system, at least one value cluster is determined for an attribute of the plurality of attributes. Each value cluster has a range. The predicate of the query is compared with the at least one value cluster of each block. The query is executed against only those blocks where the predicate is met by at least one value cluster.

Split elimination in mapreduce systems

A computer-implemented method according to one embodiment includes receiving a request for data, locating the data at one or more partitions of a heterogeneously partitioned table, determining an access method associated with each of the one or more partitions, and requesting the data from the one or more partitions, utilizing the access method associated with each of the one or more partitions.

Accessing tables with heterogeneous partitions

One embodiment provides for monotonic transactions in a multi-master database with loosely coupled nodes including performing, by a processor, a write transaction protocol including: a client device issuing write transactions at any of the nodes, recording a write transaction locally at a node that issues a write transaction and asynchronously replicating the write transaction to at least one other node, and waiting for reception of an acknowledgment from at least a quorum of the nodes before returning a response to the client device. The quorum is any set of the nodes that includes a special node and at least one other node.

Embodiments relate to aggregation operations. More specifically, embodiments relate to translating a query involving a distinct aggregate(s) into a query that does not involve a distinct aggregate. The translation involves a transformation effectively rewriting the original query containing the distinct aggregate including removal of the distinct aggregate from the query. The translated query enables the query to perform a non-distinct aggregation that effectively provides the results of the removed distinct aggregate(s).

Efficient analysis of distinct aggregations

One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Each column in the table is loaded with column values based on the identifications. Records based on the column values are written to the groomed transaction blocks that are table based, and the tuple sequence numbers for each record on groomed blocks are generated. The table is shared/sharded across nodes handling transactional operations in the multi-master distributed data management system to increase processing handling of the transactional operations.

Split elimination in MapReduce systems

Embodiments relate to parallel data streaming between a first computer system and a second computer system. Aspects include transmitting a request to establish an authenticated connection between a processing job on the first computer system and a process on the second computer system and transmitting a query to the process on the second computer system over the authenticated connection. Aspects further include creating one or more tasks on the first computer system configured to receive data from the second computer system in parallel and reading data received by the one or more tasks by the processing job on the first computer system.

Parallel data streaming between cloud-based applications and massively parallel systems

Embodiments of the invention relate to processing queries that utilize fact and/or dimension tables. In one aspect, a pre-join filtering phase precedes a star join. The necessary conditions for the pre-join filtering are considered for a given SQL query, including an estimated size of the hash table exceeding a threshold and presence of a local predicate either on the fact table or one or more dimension tables that is not a large dimension table. Once the necessary conditions are satisfied, the execution of the query exploits the pre-join filtering to build a pre-join output filter from columns of a reduced fact table that joins with each large dimension table. Thereafter, all the dimension tables and the fact table are joined in a star join while exploiting each pre-join filter.

Efficient join with one or more large dimension tables

According to one embodiment of the present invention, a method for processing join predicates in full-text indexes is provided. The method includes evaluating local predicates of an outer full text index to generate a first posting list of documents. For each document in the first posting list, the value of a join attribute is determined and an inner full text index is probed to obtain a second posting list of documents containing one of the join attributes determined for each document. Local predicates of an inner full text index are evaluated to generate a third posting list of documents, and the second posting list is merged with the third posting list to generate a merge list of documents. Documents in the first posting list may be paired up with documents in the merge list.

Join algorithms over full text indexes

Growing community of inventors

San Jose, CA, United States of America

Mir Hamid Pirahesh