Patents by Inventor Rajesh R. Bordawekar
Rajesh R. Bordawekar has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11163828Abstract: A plurality of memory maps may be allocated that represents the hash table on a memory device to store keys and values. The memory maps may comprise at least a primary map and a secondary map. A hash table operation may be performed on the primary map based on a first position computed using a first hash function, and if not successful, a bounded linear probing that probes a defined primary probe region in the primary map. Responsive to determining that the hash table operation on the primary map is not successful, the hash table operation may be performed on the secondary map based on a second position computed using a second hash function, and if not successful, a bounded linear probing that probes a defined secondary probe region in the secondary map.Type: GrantFiled: May 17, 2019Date of Patent: November 2, 2021Assignee: International Business Machines CorporationInventor: Rajesh R. Bordawekar
-
Patent number: 10963794Abstract: Mechanisms, in a system comprising a host system and at least one accelerator device, for performing a concept analysis operation are provided. The host system extracts a set of one or more concepts from an information source and provides the set of one or more concepts to the accelerator device. The host system also provides at least one matrix representation data structure representing a graph of concepts and relationships between concepts in a corpus. The accelerator device executes the concept analysis operation internal to the accelerator device to generate an output vector identifying concepts in the corpus, identified in the at least one matrix representation data structure, related to the set of one or more concepts extracted from the information source. The accelerator device outputs the output vector to the host system which utilizes the output vector to respond to a request submitted to the host system associated with the information source.Type: GrantFiled: August 2, 2019Date of Patent: March 30, 2021Assignee: International Business Machines CorporationInventors: Emrah Acar, Rajesh R. Bordawekar, Michele M. Franceschini, Luis A. Lastras-Montano, Ruchir Puri, Haifeng Qian, Livio B. Soares
-
Publication number: 20190354878Abstract: Mechanisms, in a system comprising a host system and at least one accelerator device, for performing a concept analysis operation are provided. The host system extracts a set of one or more concepts from an information source and provides the set of one or more concepts to the accelerator device. The host system also provides at least one matrix representation data structure representing a graph of concepts and relationships between concepts in a corpus. The accelerator device executes the concept analysis operation internal to the accelerator device to generate an output vector identifying concepts in the corpus, identified in the at least one matrix representation data structure, related to the set of one or more concepts extracted from the information source. The accelerator device outputs the output vector to the host system which utilizes the output vector to respond to a request submitted to the host system associated with the information source.Type: ApplicationFiled: August 2, 2019Publication date: November 21, 2019Inventors: Emrah Acar, Rajesh R. Bordawekar, Michele M. Franceschini, Luis A. Lastras-Montano, Ruchir Puri, Haifeng Qian, Livio B. Soares
-
Publication number: 20190272292Abstract: A plurality of memory maps may be allocated that represents the hash table on a memory device to store keys and values. The memory maps may comprise at least a primary map and a secondary map. A hash table operation may be performed on the primary map based on a first position computed using a first hash function, and if not successful, a bounded linear probing that probes a defined primary probe region in the primary map. Responsive to determining that the hash table operation on the primary map is not successful, the hash table operation may be performed on the secondary map based on a second position computed using a second hash function, and if not successful, a bounded linear probing that probes a defined secondary probe region in the secondary map.Type: ApplicationFiled: May 17, 2019Publication date: September 5, 2019Inventor: Rajesh R. Bordawekar
-
Patent number: 10394803Abstract: A method, apparatus, and computer program product are provided for generating a set of token sequences for at least a portion of a database, wherein each token in a sequence represents a respective database entity of the database; assigning, for each token in the set of token sequences, at least one corresponding vector from a set of vectors of a same dimension, wherein the at least one corresponding vector encodes relationships between the database entity of a token and other database entities of other tokens of the set of token sequences; and extracting, using a query language, information from the database based at least in part on the relationships encoded by the assigned vectors.Type: GrantFiled: November 13, 2015Date of Patent: August 27, 2019Assignee: International Business Machines CorporationInventors: Rajesh R. Bordawekar, Oded Shmueli
-
Patent number: 10380183Abstract: A plurality of memory maps may be allocated that represents the hash table on a memory device to store keys and values. The memory maps may comprise at least a primary map and a secondary map. A hash table operation may be performed on the primary map based on a first position computed using a first hash function, and if not successful, a bounded linear probing that probes a defined primary probe region in the primary map. Responsive to determining that the hash table operation on the primary map is not successful, the hash table operation may be performed on the secondary map based on a second position computed using a second hash function, and if not successful, a bounded linear probing that probes a defined secondary probe region in the secondary map.Type: GrantFiled: April 3, 2014Date of Patent: August 13, 2019Assignee: International Business Machines CorporationInventor: Rajesh R. Bordawekar
-
Patent number: 10373057Abstract: Mechanisms, in a system comprising a host system and at least one accelerator device, for performing a concept analysis operation are provided. The host system extracts a set of one or more concepts from an information source and provides the set of one or more concepts to the accelerator device. The host system also provides at least one matrix representation data structure representing a graph of concepts and relationships between concepts in a corpus. The accelerator device executes the concept analysis operation internal to the accelerator device to generate an output vector identifying concepts in the corpus, identified in the at least one matrix representation data structure, related to the set of one or more concepts extracted from the information source. The accelerator device outputs the output vector to the host system which utilizes the output vector to respond to a request submitted to the host system associated with the information source.Type: GrantFiled: April 9, 2015Date of Patent: August 6, 2019Assignee: International Business Machines CorporationInventors: Emrah Acar, Rajesh R. Bordawekar, Michele M. Franceschini, Luis A. Lastras-Montano, Ruchir Puri, Haifeng Qian, Livio B. Soares
-
Patent number: 10310812Abstract: Mechanisms are provided for performing a matrix operation. A processor of a data processing system is configured to perform cluster-based matrix reordering of an input matrix. An input matrix, which comprises nodes associated with elements of the matrix, is received. The nodes are clustered into clusters based on numbers of connections with other nodes within and between the clusters, and the clusters are ordered by minimizing a total length of cross cluster connections between nodes of the clusters, to thereby generate a reordered matrix. A lookup table is generated identifying new locations of nodes of the input matrix, in the reordered matrix. A matrix operation is then performed based on the reordered matrix and the lookup table.Type: GrantFiled: February 6, 2017Date of Patent: June 4, 2019Assignee: International Business Machines CorporationInventors: Emrah Acar, Rajesh R. Bordawekar, Michele M. Franceschini, Luis A. Lastras-Montano, Ruchir Puri, Haifeng Qian, Livio B. Soares
-
Publication number: 20180322295Abstract: A computer-implemented method includes receiving, by a processor system, a collection of information. The collection of information includes private information and non-private information. The method also includes producing a plurality of vectors to represent the private information and the non-private information. The plurality of vectors corresponds to encoded representations of the private information and the non-private information. The method also includes publishing at least a portion of the collection of information and the corresponding vectors.Type: ApplicationFiled: May 4, 2017Publication date: November 8, 2018Inventors: Rajesh R. Bordawekar, Oded Shmueli
-
Patent number: 10049134Abstract: Systems and methods for processing a query are provided. A method for processing a query of a tree-based dataset, comprises receiving the query, and analyzing the query and the dataset to create an execution plan for the query, wherein creating the execution plan comprises partitioning traversals over the dataset into sequential and parallel components, and distributing the components across a plurality of processing threads that independently traverse their portion of the dataset and compute local results. The method further comprises merging the local results to compute a final result.Type: GrantFiled: June 12, 2014Date of Patent: August 14, 2018Assignee: International Business Machines CorporationInventors: Rajesh R. Bordawekar, Matthew L. Boyle, Jonathan W. Dale, Vladimir Mordvinov
-
Patent number: 9838422Abstract: Detecting a denial-of-service attack on a graph database is provided. In response to receiving a request to process a graph query on the graph database from a client device via a network, a graph query pattern of the graph query is determined. In response to determining that the graph query pattern of the graph query matches a stored graph query pattern that lead to a previous denial-of-service attack on the graph database, the graph query is identified as the denial-of-service attack on the graph database. Then, the request to process the graph query is denied by dropping the graph query.Type: GrantFiled: September 15, 2015Date of Patent: December 5, 2017Assignee: International Business Machines CorporationInventors: Rajesh R. Bordawekar, Ashish Kundu
-
Publication number: 20170147287Abstract: Mechanisms are provided for performing a matrix operation. A processor of a data processing system is configured to perform cluster-based matrix reordering of an input matrix. An input matrix, which comprises nodes associated with elements of the matrix, is received. The nodes are clustered into clusters based on numbers of connections with other nodes within and between the clusters, and the clusters are ordered by minimizing a total length of cross cluster connections between nodes of the clusters, to thereby generate a reordered matrix. A lookup table is generated identifying new locations of nodes of the input matrix, in the reordered matrix. A matrix operation is then performed based on the reordered matrix and the lookup table.Type: ApplicationFiled: February 6, 2017Publication date: May 25, 2017Inventors: Emrah Acar, Rajesh R. Bordawekar, Michele M. Franceschini, Luis A. Lastras-Montano, Ruchir Puri, Haifeng Qian, Livio B. Soares
-
Publication number: 20170139984Abstract: A method, apparatus, and computer program product are provided for generating a set of token sequences for at least a portion of a database, wherein each token in a sequence represents a respective database entity of the database; assigning, for each token in the set of token sequences, at least one corresponding vector from a set of vectors of a same dimension, wherein the at least one corresponding vector encodes relationships between the database entity of a token and other database entities of other tokens of the set of token sequences; and extracting, using a query language, information from the database based at least in part on the relationships encoded by the assigned vectors.Type: ApplicationFiled: November 13, 2015Publication date: May 18, 2017Inventors: Rajesh R. Bordawekar, Oded Shmueli
-
Patent number: 9606934Abstract: Mechanisms are provided for performing a matrix operation. A processor of a data processing system is configured to perform cluster-based matrix reordering of an input matrix. An input matrix, which comprises nodes associated with elements of the matrix, is received. The nodes are clustered into clusters based on numbers of connections with other nodes within and between the clusters, and the clusters are ordered by minimizing a total length of cross cluster connections between nodes of the clusters, to thereby generate a reordered matrix. A lookup table is generated identifying new locations of nodes of the input matrix, in the reordered matrix. A matrix operation is then performed based on the reordered matrix and the lookup table.Type: GrantFiled: February 2, 2015Date of Patent: March 28, 2017Assignee: International Business Machines CorporationInventors: Emrah Acar, Rajesh R. Bordawekar, Michele M. Franceschini, Luis A. Lastras-Montano, Ruchir Puri, Haifeng Qian, Livio B. Soares
-
Publication number: 20170078324Abstract: Detecting a denial-of-service attack on a graph database is provided. In response to receiving a request to process a graph query on the graph database from a client device via a network, a graph query pattern of the graph query is determined. In response to determining that the graph query pattern of the graph query matches a stored graph query pattern that lead to a previous denial-of-service attack on the graph database, the graph query is identified as the denial-of-service attack on the graph database. Then, the request to process the graph query is denied by dropping the graph query.Type: ApplicationFiled: September 15, 2015Publication date: March 16, 2017Inventors: RAJESH R. BORDAWEKAR, ASHISH KUNDU
-
Publication number: 20160299975Abstract: Mechanisms, in a system comprising a host system and at least one accelerator device, for performing a concept analysis operation are provided. The host system extracts a set of one or more concepts from an information source and provides the set of one or more concepts to the accelerator device. The host system also provides at least one matrix representation data structure representing a graph of concepts and relationships between concepts in a corpus. The accelerator device executes the concept analysis operation internal to the accelerator device to generate an output vector identifying concepts in the corpus, identified in the at least one matrix representation data structure, related to the set of one or more concepts extracted from the information source. The accelerator device outputs the output vector to the host system which utilizes the output vector to respond to a request submitted to the host system associated with the information source.Type: ApplicationFiled: April 9, 2015Publication date: October 13, 2016Inventors: Emrah Acar, Rajesh R. Bordawekar, Michele M. Franceschini, Luis A. Lastras-Montano, Ruchir Puri, Haifeng Qian, Livio B. Soares
-
Publication number: 20160259826Abstract: Mechanisms are provided for performing a matrix operation. A processor is configured to perform hybrid compressed representation matrix operations on an input matrix that comprises zero value and non-zero value entries. A first compressed representation data structure corresponding to the input matrix, and a second compressed representation data structure are obtained, each utilizing a different format for representing the non-zero value entries of the input matrix. A matrix operation is iteratively executed on the input matrix using the first compressed representation data structure and the second compressed representation data structure. The first compressed representation data structure is utilized for a first subset of iterations of the matrix operation and the second compressed representation data structure is utilized for a second subset of iterations of the matrix operation different from the first subset of iterations.Type: ApplicationFiled: March 2, 2015Publication date: September 8, 2016Inventors: Emrah Acar, Rajesh R. Bordawekar, Michele M. Franceschini, Luis A. Lastras-Montano, Haifeng Qian, Livio B. Soares
-
Publication number: 20160224473Abstract: Mechanisms are provided for performing a matrix operation. A processor of a data processing system is configured to perform cluster-based matrix reordering of an input matrix. An input matrix, which comprises nodes associated with elements of the matrix, is received. The nodes are clustered into clusters based on numbers of connections with other nodes within and between the clusters, and the clusters are ordered by minimizing a total length of cross cluster connections between nodes of the clusters, to thereby generate a reordered matrix. A lookup table is generated identifying new locations of nodes of the input matrix, in the reordered matrix. A matrix operation is then performed based on the reordered matrix and the lookup table.Type: ApplicationFiled: February 2, 2015Publication date: August 4, 2016Inventors: Emrah Acar, Rajesh R. Bordawekar, Michele M. Franceschini, Luis A. Lastras-Montano, Ruchir Puri, Haifeng Qian, Livio B. Soares
-
Publication number: 20150363465Abstract: Systems and methods for processing a query are provided. A method for processing a query of a tree-based dataset, comprises receiving the query, and analyzing the query and the dataset to create an execution plan for the query, wherein creating the execution plan comprises partitioning traversals over the dataset into sequential and parallel components, and distributing the components across a plurality of processing threads that independently traverse their portion of the dataset and compute local results. The method further comprises merging the local results to compute a final result.Type: ApplicationFiled: June 12, 2014Publication date: December 17, 2015Inventors: Rajesh R. Bordawekar, Matthew L. Boyle, Jonathan W. Dale, Vladimir Mordvinov
-
Publication number: 20150286639Abstract: A plurality of memory maps may be allocated that represents the hash table on a memory device to store keys and values. The memory maps may comprise at least a primary map and a secondary map. A hash table operation may be performed on the primary map based on a first position computed using a first hash function, and if not successful, a bounded linear probing that probes a defined primary probe region in the primary map. Responsive to determining that the hash table operation on the primary map is not successful, the hash table operation may be performed on the secondary map based on a second position computed using a second hash function, and if not successful, a bounded linear probing that probes a defined secondary probe region in the secondary map.Type: ApplicationFiled: April 3, 2014Publication date: October 8, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Rajesh R. Bordawekar