Patents by Inventor Bishwaranjan Bhattacharjee
Bishwaranjan Bhattacharjee 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).
-
Publication number: 20140358861Abstract: Managing different versions of a data record is provided. A mapping is maintained between a version-independent logical record identifier and a version-dependent physical record row identifier that correspond to each data record within a plurality of data records of a data table using a logical record identifier to physical record row identifier indirection mapping table. Entries within leaf pages of an index associated with the data table are updated to point to the version-independent logical record identifier corresponding to a data record instead of pointing to the version-dependent physical record row identifier corresponding to the data record. The logical record identifier to physical record row identifier indirection mapping table is updated in response to performing an operation on the data record instead of updating the entries within the leaf pages of the index associated with the data table.Type: ApplicationFiled: August 17, 2013Publication date: December 4, 2014Applicant: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Mustafa Canim, Mohammad Sadoghi Hamedani, Kenneth A. Ross
-
Publication number: 20140358876Abstract: Managing different versions of a data record is provided. A mapping is maintained between a version-independent logical record identifier and a version-dependent physical record row identifier that correspond to each data record within a plurality of data records of a data table using a logical record identifier to physical record row identifier indirection mapping table. Entries within leaf pages of an index associated with the data table are updated to point to the version-independent logical record identifier corresponding to a data record instead of pointing to the version-dependent physical record row identifier corresponding to the data record. The logical record identifier to physical record row identifier indirection mapping table is updated in response to performing an operation on the data record instead of updating the entries within the leaf pages of the index associated with the data table.Type: ApplicationFiled: May 29, 2013Publication date: December 4, 2014Applicant: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Mustafa Canim, Mohammad Sadoghi Hamedani, Kenneth A. Ross
-
Publication number: 20130282765Abstract: Various embodiments of the invention relate to optimizing storage of schema-less data. A schema-less dataset including a plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of nodes is generated. Each of the nodes represents a unique property in the set of co-occurring properties. The graph further includes an edge connecting each node representing a pair of co-occurring properties. A graph coloring operation is performed on the graph. The graph coloring operation includes assigning each of nodes to a color, where nodes connected by an edge are assigned different colors. A schema is generated that assigns a column identifier from a table to each unique property represented by one of the nodes in the graph based on the color assigned to the node.Type: ApplicationFiled: April 24, 2012Publication date: October 24, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Bishwaranjan BHATTACHARJEE, Mihaela Ancuta BORNEA, Patrick DANTRESSANGLE, Julian DOLBY, Kavitha SRINIVAS, Octavian UDREA
-
Patent number: 8458191Abstract: A method (and structure) of storing schema-less data of a dataset in a relational database, includes constructing a hash table for the schema-less data, using a processor on a computer. Data in the dataset is stored in a tuple format including a subject along with at least one other entity associated to the subject. Each row of the hashtable will be dedicated to a subject of the dataset, and at least one of the at least one other entity associated with the subject in the row is to be stored in a pair-wise manner in that row of the hashtable. In an exemplary embodiment, RDF data that uses triples (subject, predicate, object) is stored with the predicate/object stored in the pair-wise manner in its associated subject row.Type: GrantFiled: March 15, 2010Date of Patent: June 4, 2013Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Kavitha Srinivas, Octavian Udrea
-
Patent number: 8255398Abstract: A method, information processing system, and computer program storage product to compress sorted values. At least a first prefix and a second prefix in a plurality of prefixes are compared. Each prefix comprises at least a portion of a plurality of sorted values. A respective prefix comprises a set of consecutive characters including at least a first character of a respective sorted value. The respective sorted value further comprising a respective suffix comprising consecutive characters of the respective sorted value that are after the respective prefix. At least a respective first character of the first prefix and a respective first character of the second prefix are determined to be substantially identical. The first prefix is merged with the second prefix into a single prefix comprising the first character. A set of suffixes associated with the first prefix is updated to reflect an association with the second prefix.Type: GrantFiled: September 30, 2008Date of Patent: August 28, 2012Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Sherman Lau, Lipyeow Lim, Timothy R. Malkemus, Cathy McArthur, George A. Mihaila, Reza Sherkat, Zoltan G. Toth
-
Patent number: 8200645Abstract: An index scan processor and method to perform concurrent scans of stored indexed data. An indexed data scanner performs a first scan of stored data by sequentially scanning through an index data structure and maintains, over a duration of the first scan, a first scan current scan location within the index data structure that indicates a currently accessed record within the stored data structure for the first scan. A scan manager accepts a request for a second scan of the stored data, determines, during the performing the first scan, a starting index scan location within the index data structure for the second scan that is sufficiently near the first scan current index scan location to cause records indicated by the starting location index to be stored within a buffer due to the performing the first scan, and starts the second scan at the starting location and proceeding to the second end key.Type: GrantFiled: September 21, 2007Date of Patent: June 12, 2012Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Christian A. Lang, Timothy R. Malkemus
-
Patent number: 8176035Abstract: A computer implemented method, apparatus, and computer usable program code for detecting monotonicity. A determination is made as to whether a function that is assumed to be monotonic will remain monotonic after performing an operation in response to receiving the operation. The operation is allowed to be performed in response to a determination that the function will remain monotonic after performing the operation.Type: GrantFiled: May 2, 2008Date of Patent: May 8, 2012Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Timothy Ray Malkemus
-
Patent number: 8161241Abstract: A system and method for managing a cache includes monitoring a temperature of regions on a secondary storage based on a cumulative cost to access pages from each region of the secondary storage. Similar temperature pages are grouped in logical blocks. Data is written to a cache in a logical block granularity by overwriting cooler blocks with hotter blocks.Type: GrantFiled: January 12, 2010Date of Patent: April 17, 2012Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Mustafa Canim, Christian A. Lang, George A. Mihaila, Kenneth A. Ross
-
Patent number: 8140516Abstract: Disclosed is a data processing system implemented method, a data processing system and an article of manufacture for improving execution efficiency of a database workload to be executed against a database. The database includes database tables, and the database workload identifies at least one of the database tables. The data processing system includes an identification module for identifying candidate database tables being identifiable in the database workload, the identified candidate database tables being eligible for organization under a clustering schema, a selection module for selecting the identified candidate tables according to whether execution of the database workload is improved if the selected identified candidate table is organized according to the clustering scheme, and an organization module for organizing the clustering schema of the selected organized identified candidate tables prior to the database workload being execution against the database.Type: GrantFiled: December 8, 2008Date of Patent: March 20, 2012Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Sam Sampson Lightstone, Timothy Ray Malkemus, Sriram K. Padmanabhan, Adam J. Storm, Daniele Costante Zilio
-
Method and apparatus for encoding list of variable length structures to support bi-directional scans
Patent number: 8126929Abstract: Techniques are disclosed for encoding a variable length structure such that it facilitates forward and reverse scans of a list of such structures as needed. While the techniques are applicable to a wide variety of applications, they are particularly well-suited for use with structures such as those found in compressed database indexes. For example, a computer-implemented method for processing one or more variable length data structures includes the following steps. Each variable length data structure is obtained. Each variable length structure comprises one or more data block. A variable length encoding process is applied to the one or more blocks of each variable length data structure which comprises setting a continuation data value in each block to a first value or a second value, wherein the setting of the continuation data values enables bi-directional scanning of each variable length structure.Type: GrantFiled: March 27, 2008Date of Patent: February 28, 2012Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Lipyeow Lim, Timothy Ray Malkemus, George Andrei Mihaila -
Publication number: 20110225167Abstract: A method (and structure) of storing schema-less data of a dataset in a relational database, includes constructing a hash table for the schema-less data, using a processor on a computer. Data in the dataset is stored in a tuple format including a subject along with at least one other entity associated to the subject. Each row of the hashtable will be dedicated to a subject of the dataset, and at least one of the at least one other entity associated with the subject in the row is to be stored in a pair-wise manner in that row of the hashtable. In an exemplary embodiment, RDF data that uses triples (subject, predicate, object) is stored with the predicate/object stored in the pair-wise manner in its associated subject row.Type: ApplicationFiled: March 15, 2010Publication date: September 15, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Bishwaranjan Bhattacharjee, Kavitha Srinivas, Octavian Udrea
-
Patent number: 8010766Abstract: Disclosed are a method, information processing system, and computer readable medium for managing table scan processes. The method includes monitoring a plurality of storage medium table scan processes. Each storage medium table scan process in the plurality of storage medium table scan processes is placed into a plurality of scan groups based on storage medium pages to be scanned by each of the storage medium table scan processes. Each storage medium table scan process in a scan group can share data within a storage medium page.Type: GrantFiled: October 12, 2006Date of Patent: August 30, 2011Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Christian A. Lang, Timothy R. Malkemus, Sriram Padmanabhan, Kwai Wong
-
Patent number: 8005872Abstract: A computer implemented method, apparatus, and computer usable program code for deleting rows in a multidimensionally clustering database. A multidimensional clustering processor receives a request to delete a set of multidimensionally clustering data. The multidimensional clustering processor determines whether all multidimensionally clustering data is located in a block. Responsive to all multidimensionally clustered data qualifying for deletion, the multidimensional clustering processor deletes all data in the block to delete the set of multidimensionally clustered data.Type: GrantFiled: May 22, 2008Date of Patent: August 23, 2011Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Leslie A. Buback, Timothy Ray Malkemus, Michael J. Winer
-
Publication number: 20110173395Abstract: A system and method for managing a cache includes monitoring a temperature of regions on a secondary storage based on a cumulative cost to access pages from each region of the secondary storage. Similar temperature pages are grouped in logical blocks. Data is written to a cache in a logical block granularity by overwriting cooler blocks with hotter blocks.Type: ApplicationFiled: January 12, 2010Publication date: July 14, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: BISHWARANJAN BHATTACHARJEE, Mustafa Canim, Christian A. Lang, George A. Mihaila, Kenneth A. Ross
-
Patent number: 7937541Abstract: Disclosed are a method, information processing system, and computer readable medium for scanning a storage medium table. The method includes retrieving location information associated with at least one other storage medium table scan. A storage medium table scan is started at a location within a storage medium table based on at least a location of the one other storage medium table scan. A weight is assigned to at least one storage medium block based on at least a current scanning location within the storage medium table relative to the location of the one other table scan. The method determines if a distance between the current scanning location and the location of the one other table scan is greater than a first given threshold. A current scanning operation is delayed, in response to the distance being greater than the given threshold, until the distance is below a second given threshold.Type: GrantFiled: October 12, 2006Date of Patent: May 3, 2011Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Christian A. Lang, Timothy R. Malkemus, Sriram Padmanabhan, Kwai Wong
-
Patent number: 7895171Abstract: A method, information processing system, and computer readable storage product estimate a compression factor. A set of key values within an index are analyzed. Each key value is associated with a record identifier (“RID”) list comprising a set of RIDs. The index is in an uncompressed format and includes a total byte length. A number of RIDs associated with each key value is estimated for each key value in the set of key values. A total byte length for all RID deltas between each at least two consecutive RIDs within a RID list is estimated for each RID list based on the number of RIDs that have been determined. The total byte length estimated for each RID list is accumulated. A compression factor associated with the index is determined by dividing the total byte length that has been accumulated by the byte length of the index.Type: GrantFiled: March 27, 2008Date of Patent: February 22, 2011Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Lipyeow Lim, George A. Mihaila
-
Patent number: 7885976Abstract: A device for limiting access to data in a database includes an input for receiving a request to access data in a database and a processor that is communicatively coupled to the input and allows access to the data in the database. A data counter for counting an instantaneous rate of data flow and/or a volume of data accessed and a comparator for determining if the data flow and/or the volume of data accessed in the database exceeds a previously specified value is also included, wherein the processor disallows access to the data in the database in response to the instantaneous rate and/or the volume of data exceeding the previously specified value.Type: GrantFiled: February 23, 2007Date of Patent: February 8, 2011Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Asit Dan
-
Patent number: 7836036Abstract: A method and processor to determine distances between multiple index driven scan operations. A first anchor index entry is identified during a first index scan and stored. A first number of index entries between the first anchor index entry and a first index scan location being processed by a first index scan is determined based on information maintained external to an index structure. A determination is made of second number of index entries between the first anchor index entry and a second index scan location being processed by a second index scan executing concurrently with the first index scan based on information maintained external to the index structure. A distance between the first index scan location and the second index scan location is calculated as equal to a difference between the first number of index entries and the second number of index entries.Type: GrantFiled: September 21, 2007Date of Patent: November 16, 2010Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Christian A. Lang, Timothy R. Malkemus
-
Publication number: 20100262633Abstract: A method, information processing system, and computer program storage product optimize the placement of database objects on a multiplicity of storage devices. A set of database objects are placed on a first storage device in a multiplicity of storage devices. Each storage device comprises differing characteristics. A query workload is run on the set of database objects that have been placed on the first storage device. Profiling information associated with the query workload that is running is collected. A subset of database objects is selected from the set of the database objects to be stored on a second storage device. The second storage device is a separate physical device from, and performs faster than, the first storage device. The subset of database objects is stored on the second storage device and all remaining database objects in the set of database objects on the first storage device.Type: ApplicationFiled: April 14, 2009Publication date: October 14, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Bishwaranjan BHATTACHARJEE, Mustafa CANIM, George Andrei MIHAILA
-
Patent number: 7765211Abstract: An information retrieval system and method are provided for minimizing the number of blocks searched in a cell before recording a new record in the table and determining which block can be assigned if a table has space available to store a new record in the case an additional block should be associated with a cell. Dimensions for a table are identified, and at least one block in the table is associated with a dimension value for each dimension, where each block comprises contiguous storage pages. The block can be further associated with a cell; this associated cell has a unique combination of dimension values comprising an dimension value for each of the dimensions. A unique associated bit list for each dimension value for each dimension has a unique corresponding list entry for each block associated with that dimension value, and a unique associated bit list for each cell has a unique corresponding list entry for each block associated with that cell.Type: GrantFiled: April 29, 2003Date of Patent: July 27, 2010Assignee: International Business Machines CorporationInventors: Bishwaranjan Bhattacharjee, Leslie A. Cranston, Matthew A. Huras, Bruce G. Lindsay, Timothy R. Malkemus, Catherine S. McArthur, Sriram K. Padmanabhan, Michael J. Winer