Patents by Inventor Ramesh C. Agarwal
Ramesh C. 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: 7299404Abstract: A repository index records the position of document entries relative to landmark entries within the document. Landmark entries are selecting using a landmarking policy and their position relative to the document are stored in a landmark directory. During index updates, an edit transcript is generated describing the difference between old and new document versions, and both the document repository index and the landmark directory are updated as needed. Thus, the number of update operations preformed as compared with conventional indexing techniques may be substantially reduced when small, localized changes are made to the document. This is due to fact that the positions of document entries are recorded relative to the landmark entries rather than the document itself. By doing so, the document index becomes more shift-invariant, requiring fewer update operations when entries are added or inserted in localized areas of the document.Type: GrantFiled: May 6, 2003Date of Patent: November 20, 2007Assignee: International Business Machines CorporationInventors: Ramesh C. Agarwal, Lipyeow Lim, Sriram K. Padmanabhan, Min Wang
-
Multidimensional data clustering scheme for query processing and maintenance in relational databases
Patent number: 7080081Abstract: Multidimensional clustered tables are provided for efficient processing and management in a relational database management system. A multidimensional clustered table is one whose data is simultaneously clustered along one or more independent dimensions, or clustering keys, and physically organized into blocks or pages on disk. When such a table is created, one can specify one or more keys as dimensions along which to cluster the table's data. Each of the dimensions can consist of one or more columns. Further provided are efficient query processing and maintenance techniques for use in conjunction with multidimensional clustered tables.Type: GrantFiled: April 15, 2002Date of Patent: July 18, 2006Assignee: International Business Machines CorporationInventors: Ramesh C. Agarwal, Bishwaranjan Bhattacharjee, Leslie A. Cranston, Matthew A. Huras, Tony Wen Hsun Lai, Timothy R. Malkemus, Sriram K. Padmanabhan -
Publication number: 20040225963Abstract: A repository index records the position of document entries relative to landmark entries within the document. Landmark entries are selecting using a landmarking policy and their position relative to the document are stored in a landmark directory. During index updates, an edit transcript is generated describing the difference between old and new document versions, and both the document repository index and the landmark directory are updated as needed. Thus, the number of update operations preformed as compared with conventional indexing techniques may be substantially reduced when small, localized changes are made to the document. This is due to fact that the positions of document entries are recorded relative to the landmark entries rather than the document itself. By doing so, the document index becomes more shift-invariant, requiring fewer update operations when entries are added or inserted in localized areas of the document.Type: ApplicationFiled: May 6, 2003Publication date: November 11, 2004Inventors: Ramesh C. Agarwal, Lipyeow Lim, Sriram K. Padmanabhan, Min Wang
-
Multidimensional disk clustering scheme for query processing and maintenance in relational databases
Publication number: 20030195898Abstract: Multidimensional clustered tables are provided for efficient processing and management in a relational database management system. A multidimensional clustered table is one whose data is simultaneously clustered along one or more independent dimensions, or clustering keys, and physically organized into blocks or pages on disk. When such a table is created, one can specify one or more keys as dimensions along which to cluster the table's data. Each of the dimensions can consist of one or more columns. Further provided are efficient query processing and maintenance techniques for use in conjunction with multidimensional clustered tables.Type: ApplicationFiled: April 15, 2002Publication date: October 16, 2003Applicant: International Business Machines CorporationInventors: Ramesh C. Agarwal, Bishwaranjan Bhattacharjee, Leslie A. Cranston, Matthew A. Huras, Tony Wen Hsun Lai, Timothy R. Malkemus, Sriram K. Padmanabhan -
Patent number: 6389416Abstract: A system and method for generating itemset associations in a memory storage system comprising many transactions, with each transaction including one or more items capable of forming the itemset associations. The method involves generating a lexicographic tree structure having nodes representing itemset associations meeting a minimum support criteria. In a recursive manner, for each lexicographic least itemset (node) P of the lexicographic tree structure, candidate extensions of the node P are first determined. Then, the support of each of the candidate extensions is counted to determine frequent extension itemsets of that node P, while those itemsets not meeting a predetermined support criteria are eliminated. Child nodes corresponding to the frequent extensions and meeting the predetermined support criteria are created. For each frequent child of node P, all itemset associations for all descendants of node P are generated first. Thus, the lexicographic tree structure is generated in a depth first manner.Type: GrantFiled: February 19, 1999Date of Patent: May 14, 2002Assignee: International Business Machines CorporationInventors: Ramesh C. Agarwal, Charu C. Aggarwal, V. V. V. Prasad
-
Patent number: 6311179Abstract: A method for automatically generating associations of items included in a database. A user first specifies a support criteria indicating a strength of desired associations of items contained in the said database. Then, a recursive program is executed for generating a hierarchical tree structure comprising one or more levels of database itemsets, with each itemset representing item associations determined to have satisfied the specified support criteria.Type: GrantFiled: October 30, 1998Date of Patent: October 30, 2001Assignee: International Business Machines CorporationInventors: Ramesh C. Agarwal, Charu C. Aggarwal, V. V. V. Prasad
-
Patent number: 5563818Abstract: A method and system for performing floating-point division of a dividend by a divisor within a floating-point unit having multiply and add functions are disclosed. In performing floating-point division, a quotient having a mantissa is produced. The method uses an approximation based on a linear approximation stored within a first table. The first approximation approximates two divided by the divisor. A second table value is also selected from the table lookup. The second table value approximates the reciprocal of the divisor squared. Both the first and second table values operate as linear correction terms. Also according to the present invention, a method and system are disclosed that perform an early exit check during the division operation to confirm whether the resultant quotient has an acceptable accuracy and if the accuracy is unacceptable, then perform a rounding correction based upon a given rounding boundary.Type: GrantFiled: December 12, 1994Date of Patent: October 8, 1996Assignee: International Business Machines CorporationInventors: Ramesh C. Agarwal, Andrew A. Bjorksten, Freg G. Gustavson
-
Patent number: 5513366Abstract: A controller is coupled to a plurality of registers arranged in an array having a physical configuration of N rows of registers and M columns of registers. A size register within the controller is provided for receiving a selected vector size parameter, which specifies a number of registers comprising a vector register. In response to the vector size parameter, columns in the register array are selected and concatenated to form a vector register having at least a number of registers equal to the vector size parameter. An offset parameter may be utilized to select columns that form a vector register from the M number of columns in the array. Multiple arithmetic logic units, where one arithmetic logic unit is coupled to each row of registers are utilized to perform vector operations. Any register in the array may be utilized to store a vector element or a scalar expression.Type: GrantFiled: September 28, 1994Date of Patent: April 30, 1996Assignee: International Business Machines CorporationInventors: Ramesh C. Agarwal, Randall D. Groves, Fred G. Gustavson, Mark A. Johnson, Brett Olsson