Patents by Inventor Manoj K Agarwal
Manoj K Agarwal 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: 8959519Abstract: Methods and arrangements for processing hierarchical data in a map-reduce framework. Hierarchical data is accepted, and a map-reduce job is performed on the hierarchical data. This performing of a map-reduce job includes determining a cost of partitioning the data, determining a cost of redefining the job and thereupon selectively performing at least one step taken from the group consisting of: partitioning the data and redefining the job.Type: GrantFiled: August 29, 2012Date of Patent: February 17, 2015Assignee: International Business Machines CorporationInventors: Manoj K. Agarwal, Himanshu Gupta, Rajeev Gupta, Sriram K. Padmanabhan, Prasan Roy
-
Publication number: 20140337364Abstract: Database operation records are sequentially read from two or more log files. If the transaction identifier is new and the record is not an end-of-transaction record, an open transactions list entry is created. If the transaction identifier is new and the record is an end-of-transaction record, a transaction type list entry is created or updated. If the transaction identifier is not new and is not an end-of-transaction record, an open transactions list entry is updated. If the transaction identifier is not new and the record is an end-of-transaction record, a transaction type list entry is created or updated. When all log file records are read, analytical comparison between the information associated with two or more of the log files in data fields in the transaction type list entries is performed.Type: ApplicationFiled: May 22, 2013Publication date: November 13, 2014Inventors: Manoj K. Agarwal, Curt L. Cotner, Amitava Kundu, Rajesh Sambandhan
-
Publication number: 20140337283Abstract: Database operation records are sequentially read from two or more log files. If the transaction identifier is new and the record is not an end-of-transaction record, an open transactions list entry is created. If the transaction identifier is new and the record is an end-of-transaction record, a transaction type list entry is created or updated. If the transaction identifier is not new and is not an end-of-transaction record, an open transactions list entry is updated. If the transaction identifier is not new and the record is an end-of-transaction record, a transaction type list entry is created or updated. When all log file records are read, analytical comparison between the information associated with two or more of the log files in data fields in the transaction type list entries is performed.Type: ApplicationFiled: May 9, 2013Publication date: November 13, 2014Applicant: International Business Machines CorporationInventors: Manoj K. Agarwal, Curt L. Cotner, Amitava Kundu, Rajesh Sambandhan
-
Publication number: 20140279945Abstract: Identifying matching transactions. First and second log files contain operation records of transactions in a transaction workload, each file recording a respective execution of the transaction workload, the method comprising. A first record location in the first file and an associated window of a defined number of sequential second record locations in the second file are advanced one record location at a time. Whether each operation record of a complete transaction at a first record location has a matching operation record at one of the record locations in the associated window of second record locations is determined. If so, the complete transaction in the first file and the transaction that includes the matching operation records in the second file are identified as matching transactions.Type: ApplicationFiled: June 2, 2014Publication date: September 18, 2014Applicant: International Business Machines CorporationInventors: Manoj K. Agarwal, Curt L. Cotner, Amitava Kundu, Prasan Roy, Rajesh Sambandhan
-
Publication number: 20140236976Abstract: A predefined number of matches is identified between records in a first file and records in a second file. For the matches, determine the span of the actual range of record positions in the second file relative to the positions of the operation records in the first file within which all matches were found. If the actual span is smaller than the span of a current defined range of record positions by at least a first threshold value, decrease the span of the current defined range. If the actual span is within a second threshold value of the span of the current defined range, increase the span of the current defined range. If an amount above a third threshold value of operation records in the first file are not matched to operation records in the second file, increasing the span of the current defined range.Type: ApplicationFiled: February 21, 2013Publication date: August 21, 2014Applicant: International Business Machines CorporationInventors: Manoj K. Agarwal, Curt L. Cotner, Amitava Kundu, Prasan Roy, Rajesh Sambandhan
-
Patent number: 8788473Abstract: A method for identifying matching transactions between two log files where each transaction includes one or more statements. Each log file record records the execution of a statement and includes a transaction identifier. Each record in turn in one log file is compared to an advancing window of records in the other log file. A first table contains associations of statements to transactions and transactions to statements for records in the window. If a match is found between a record in the one file and a record in the window, information associating partial transactions in the one file to potential transactions of the records in the window is added to a second table. If an end-of-transaction record is read from the one file, a best match is found between the ended transaction and the potential transactions based on information in the first and second tables.Type: GrantFiled: May 31, 2013Date of Patent: July 22, 2014Assignee: International Business Machines CorporationInventors: Manoj K. Agarwal, Curt L. Cotner, Amitava Kundu, Prasan Roy, Rajesh Samabandhan
-
Patent number: 8788471Abstract: A method for identifying matching transactions between two log files where each transaction includes one or more statements. Each log file record records the execution of a statement and includes a transaction identifier. Each record in turn in one log file is compared to an advancing window of records in the other log file. A first table contains associations of statements to transactions and transactions to statements for records in the window. If a match is found between a record in the one file and a record in the window, information associating partial transactions in the one file to potential transactions of the records in the window is added to a second table. If an end-of-transaction record is read from the one file, a best match is found between the ended transaction and the potential transactions based on information in the first and second tables.Type: GrantFiled: May 30, 2012Date of Patent: July 22, 2014Assignee: International Business Machines CorporationInventors: Manoj K. Agarwal, Curt L. Cotner, Amitava Kundu, Prasan Roy, Rajesh Sambandhan
-
Publication number: 20140195505Abstract: A log file contains operation records, each operation record is of a certain type, and each operation record is associated with a transaction. A plurality of operation records is read from the log file into a record store. Records of the plurality of operation records of each operation record type are sampled at a predefined sampling rate. Operation records in the plurality of operations records are identified that are associated with completed transactions of which the sampled operation records are associated. The identified operation records are then extracted from the record store into a data store.Type: ApplicationFiled: March 11, 2014Publication date: July 10, 2014Applicant: International Business Machines CorporationInventors: Manoj K. Agarwal, Curt L. Cotner, Amitava Kundu
-
Publication number: 20140188783Abstract: A log file contains operation records, each operation record is of a certain type, and each operation record is associated with a transaction. A plurality of operation records is read from the log file into a record store. Records of the plurality of operation records of each operation record type are sampled at a predefined sampling rate. Operation records in the plurality of operations records are identified that are associated with completed transactions of which the sampled operation records are associated. The identified operation records are then extracted from the record store into a data store.Type: ApplicationFiled: January 3, 2013Publication date: July 3, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Manoj K. Agarwal, Curt L. Cotner, Amitava Kundu
-
Patent number: 8719270Abstract: A method, computer program product, and system for enabling parallel processing of an XML document without pre-parsing, utilizing metadata associated with the XML document and created at the same time as the XML document. The metadata is used to generate partitions of the XML document at the time of parallel processing, without requiring system-intensive pre-parsing.Type: GrantFiled: March 7, 2012Date of Patent: May 6, 2014Assignee: International Business Machines CorporationInventors: Manoj K. Agarwal, Manish A. Bhide, Srinivas K. Mittapalli, Sriram K. Padmanabhan, Girish Venkatachaliah
-
Patent number: 8719268Abstract: A method, computer program product, and system for enabling parallel processing of an XML document without pre-parsing, utilizing metadata associated with the XML document and created at the same time as the XML document. The metadata is used to generate partitions of the XML document at the time of parallel processing, without requiring system-intensive pre-parsing.Type: GrantFiled: September 29, 2010Date of Patent: May 6, 2014Assignee: International Business Machines CorporationInventors: Manoj K. Agarwal, Manish A. Bhide, Srinivas K. Mittapalli, Sriram K. Padmanabhan, Girish Venkatachaliah
-
Patent number: 8677366Abstract: Methods and arrangements for processing hierarchical data in a map-reduce framework. Hierarchical data is accepted, and a map-reduce job is performed on the hierarchical data. This performing of a map-reduce job includes determining a cost of partitioning the data, determining a cost of redefining the job and thereupon selectively performing at least one step taken from the group consisting of: partitioning the data and redefining the job.Type: GrantFiled: May 31, 2011Date of Patent: March 18, 2014Assignee: International Business Machines CorporationInventors: Manoj K. Agarwal, Himanshu Gupta, Rajeev Gupta, Sriram K. Padmanabhan, Prasan Roy
-
Publication number: 20130325826Abstract: A method for identifying matching transactions between two log files where each transaction includes one or more statements. Each log file record records the execution of a statement and includes a transaction identifier. Each record in turn in one log file is compared to an advancing window of records in the other log file. A first table contains associations of statements to transactions and transactions to statements for records in the window. If a match is found between a record in the one file and a record in the window, information associating partial transactions in the one file to potential transactions of the records in the window is added to a second table. If an end-of-transaction record is read from the one file, a best match is found between the ended transaction and the potential transactions based on information in the first and second tables.Type: ApplicationFiled: May 30, 2012Publication date: December 5, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Manoj K. Agarwal, Curt L. Cotner, Amitava Kundu, Prasan Roy, Rajesh Sambandhan
-
Publication number: 20130325829Abstract: A method for identifying matching transactions between two log files where each transaction includes one or more statements. Each log file record records the execution of a statement and includes a transaction identifier. Each record in turn in one log file is compared to an advancing window of records in the other log file. A first table contains associations of statements to transactions and transactions to statements for records in the window. If a match is found between a record in the one file and a record in the window, information associating partial transactions in the one file to potential transactions of the records in the window is added to a second table. If an end-of-transaction record is read from the one file, a best match is found between the ended transaction and the potential transactions based on information in the first and second tables.Type: ApplicationFiled: May 31, 2013Publication date: December 5, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Manoj K. Agarwal, Curt L. Cotner, Amitava Kundu, Prasan Roy, Rajesh Sambandhan
-
Publication number: 20130254237Abstract: A method for receiving a declarative specification including a plurality of stages. Each stage specifies an atomic operation, a data input to the atomic operation, and a data output from the atomic operation. The data input is characterized by a data type. Links between at least two of the stages are generated to create a data integration workflow. The data integration workflow is compiled to generate computer code for execution on a parallel processing platform. The computer code configured to perform at least one of data preparation and data analysis.Type: ApplicationFiled: April 29, 2013Publication date: September 26, 2013Applicant: International Business Machines CorporationInventors: Manoj K. Agarwal, Himanshu Gupta, Rajeev Gupta, Sanjeev K. Gupta, Mukesh K. Mohania, Sriram K. Padmanabhan, Prasan Roy
-
Patent number: 8473513Abstract: Methods and arrangements for extracting tuples from a streaming XML document. A query twig is applied to the XML document stream, tuples are extracted from the XML document stream based on the query twig, and a quantity of extracted tuples is limited via foregoing extraction of duplicate tuples extraction of tuples that do not satisfy query twig criteria.Type: GrantFiled: January 31, 2010Date of Patent: June 25, 2013Assignee: International Business Machines CorporationInventors: Manoj K. Agarwal, Manish A. Bhide, Srinivas K. Mittapalli, Mukesh K. Mohania, Sriram K. Padmanabhan
-
Publication number: 20130086116Abstract: A method for receiving a declarative specification including a plurality of stages. Each stage specifies an atomic operation, a data input to the atomic operation, and a data output from the atomic operation. The data input is characterized by a data type. Links between at least two of the stages are generated to create a data integration workflow. The data integration workflow is compiled to generate computer code for execution on a parallel processing platform. The computer code configured to perform at least one of data preparation and data analysis.Type: ApplicationFiled: October 4, 2011Publication date: April 4, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Manoj K. Agarwal, Himanshu Gupta, Rajeev Gupta, Sanjeev K. Gupta, Mukesh K. Mohania, Sriram K. Padmanabhan, Prasan Roy
-
Patent number: 8370443Abstract: A resend operation of application-level messages by communicating control messages over a publish/subscribe channel. A sending module sends application-level original messages to recipients, and stores a copy of the original message in a store. A resend determination module determines, in the event of insufficient acknowledgement of the original message, whether the original message should be resent. If the original message should be resent, the resend determination module also publishes a control message that correlates to the original message. A resend module subscribes in a manner that results in the resend module receiving the control message, and uses the control message to determine that the corresponding original message should be resent, whereupon the original message may be resent using the copy of the original message in the store.Type: GrantFiled: September 8, 2009Date of Patent: February 5, 2013Assignee: Microsoft CorporationInventors: Yuri A. Bogucharov, Mithun Arora, Manoj K. Agarwal
-
Publication number: 20120320059Abstract: Arrangements and methods for employing empirical evidence to estimate the performance of applications with very few data samples, in complex environments such as dynamic SDP environments, using one or more effective data-plotting models.Type: ApplicationFiled: August 27, 2012Publication date: December 20, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Manoj K. Agarwal
-
Publication number: 20120324459Abstract: Methods and arrangements for processing hierarchical data in a map-reduce framework. Hierarchical data is accepted, and a map-reduce job is performed on the hierarchical data. This performing of a map-reduce job includes determining a cost of partitioning the data, determining a cost of redefining the job and thereupon selectively performing at least one step taken from the group consisting of: partitioning the data and redefining the job.Type: ApplicationFiled: August 29, 2012Publication date: December 20, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Manoj K. Agarwal, Himanshu Gupta, Rajeev Gupta, Sriram K. Padmanabhan, Prasan Roy