Patents by Inventor Sriram Padmanabhan
Sriram Padmanabhan 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: 20120058211Abstract: The invention provides therapeutic, defined-dose anti-bacterial phage preparations, methods to make such preparations, methods to treat bacterial infections using such preparations and methods to diagnose bacterial infections using such preparations.Type: ApplicationFiled: November 9, 2011Publication date: March 8, 2012Applicant: GangaGen, Inc.Inventors: Jayasheela Manur, Bharathi Sriram, Sriram Padmanabhan
-
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
-
Publication number: 20110165583Abstract: A modified vector comprising a reporter gene having a STOP codon upstream of the multiple cloning site of the vector which is characterized in that the recombinant clones show fluoresce or show color in presence of inducer. A method for identification and selection of recombinant clones comprising the modified vector wherein the recombinant clones florescence or show color in a suitable suppressor strain of the STOP codon associated with the gene of interest.Type: ApplicationFiled: September 2, 2009Publication date: July 7, 2011Applicant: Lupin LimitedInventors: Anjali Apte Deshpande, Sampali Banerjee, Jitendra Kumar, Sriram Padmanabhan
-
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
-
Publication number: 20110072319Abstract: Techniques for running an Extract Transform Load (ETL) job in parallel on one or more processors wherein the ETL job comprises use of an extensible markup language (XML) document are provided. The techniques include receiving an XML document input, identifying a node in the XML document at which partitioning of the XML document is to begin, sending partition information to each respective processor, performing a shallow parsing of the XML document in parallel on the one or more processors, wherein each processor performs shallow parsing using the identified partition node until it reaches its identified partition, using the shallow parsing to generate the partition of the input XML document, wherein each processor generates a different partition of the same XML document, and sending each partition in streaming format to an ETL job instance.Type: ApplicationFiled: September 24, 2009Publication date: March 24, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Manoj K. Agarwal, Manish A. Bhide, Srilakshmi Kotwal, Srinivas Kiran Mittapalli, Sriram Padmanabhan
-
Publication number: 20100303862Abstract: The present invention features incapacitated whole-cell bacterial immunogenic compositions and methods of their production, which compositions are useful to deliver antigens in a manner resembling the live infectious organism in terms of elicitation of a robust immune response, but with reduced risk or no risk of disease. The compositions of the invention are produced by rendering a bacterium bacteriostatic through expression of a recombinant promoter in the bacterial cell, which promoter can be operably linked to a polynucleotide encoding a recombinant gene product. In one embodiment, where the bacterium is a gram negative host, the recombinant gene product provides for reduced toxicity of LPS. In one embodiment, the gene product is a bacteriophage protein, such as endolysin, holin, or ndd.Type: ApplicationFiled: September 15, 2009Publication date: December 2, 2010Applicant: GANGAGEN, INC.Inventors: Janakiraman Ramachandran, Sriram Padmanabhan, Bharathi Sriram
-
Publication number: 20090324576Abstract: The present invention provides methods and compositions to reduce growth of microbial colonies, including infections, and includes therapeutic compositions, methods for treatment of infections, and methods for identifying additional such compositions.Type: ApplicationFiled: May 4, 2007Publication date: December 31, 2009Applicant: GangaGen, Inc.Inventors: Sriram Padmanabhan, Vivek Daniel Paul, R. Sanjeev Saravanan, Bharathi Sriram
-
Patent number: 7483890Abstract: A tagging tree that defines a hierarchical output data structure and relational database query operations that retrieve the data to be included in each hierarchical section is accepted and processed. A query optimizer analyzes the tagging tree to determine database query operations that can be combined into a single query command. An outer-union query command is generated to allow efficient combination of multiple query commands, some of which are predicates to others. The tagging tree is modified to replace the database queries that were combined into the outer-union query to extract data from the results set produced by the outer-union query as opposed to submitting queries to the database manager. The optimized queries can be reused an arbitrary number of times to leverage the optimizing resources that were used in their creation.Type: GrantFiled: January 17, 2007Date of Patent: January 27, 2009Assignee: International Business Machines CorporationInventors: Nianjun Zhou, George Andrei Mihaila, Dikran S. Meliksetian, Sriram Padmanabhan
-
Patent number: 7469249Abstract: Techniques are provided for automatically rewriting a relational-to-hierarchical mapping into one or more modified mappings. In this way, clients that prefer or require different portions of the mapping-defined data are supported. For example, in one aspect of the invention, a technique for modifying a relational-to-hierarchical mapping in accordance with at least one user query includes the following steps/operations. At least one query associated with a query language that supports a hierarchical data structure is obtained. Further, at least one relational-to-hierarchical mapping for use in translating data associated with a relational data structure into data associated with the hierarchical data structure is obtained. Then, the at least one relational-to-hierarchical mapping is modified based on the at least one query such that data specifically relevant to the at least one query may be generated in accordance with the modified relational-to-hierarchical mapping.Type: GrantFiled: March 8, 2004Date of Patent: December 23, 2008Assignee: International Business Machines CorporationInventors: George Andrei Mihaila, Sriram Padmanabhan, Oded Shmueli
-
Publication number: 20080144128Abstract: 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: ApplicationFiled: October 12, 2006Publication date: June 19, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Bishwaranjan Bhattacharjee, Christian A. Lang, Timothy R. Malkemus, Sriram Padmanabhan, Kwai Wong
-
Publication number: 20080091908Abstract: 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: ApplicationFiled: October 12, 2006Publication date: April 17, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Bishwaranjan Bhattacharjee, Christian A. Lang, Timothy R. Malkemus, Sriram Padmanabhan, Kwai Wong
-
Patent number: 7313563Abstract: A method, a system and recording medium for maintaining the order of nodes in a hierarchical document. The method may select the maximum and the minimum number of children for each node, build an auxiliary ordered tree having at least as many leaves as atoms within the hierarchical document based upon the selected maximum and minimum number of children for each node, attach the atoms to the leaves of the auxiliary ordered tree, and label each of the nodes in the auxiliary ordered tree.Type: GrantFiled: July 30, 2003Date of Patent: December 25, 2007Assignee: International Business Machines CorporationInventors: Rajesh Bordawekar, Yi Chen, George A. Mihaila, Sriram Padmanabhan
-
Patent number: 7269729Abstract: Disclosed is a method of internally encrypting data in a relational database, comprising the steps of providing a security dictionary comprising one or more security catalogs, receiving data from a user associating said data with a database column and at least one authorized user, generating a working encryption key, internally encrypting said working encryption key using a public key from an authorized user, storing said encrypted working key in a security catalog, and using said working key to internally encrypt said data.Type: GrantFiled: December 28, 2001Date of Patent: September 11, 2007Assignee: International Business Machines CorporationInventors: Jingmin He, Sriram Padmanabhan, Min Wang
-
Publication number: 20070143321Abstract: A system and method of converting a recursive XML document into a relational schema comprises providing a recursive XML document; parsing an external mapping script specifying a mapping from the recursive XML document to a relational table format; building a recursive shredding tree based on the external mapping script and the relational table format; and shredding the mapped recursive XML document into a relational table. The system and method further comprise detecting whether any of a XML schema and a DTD document is recursive, wherein the detecting comprises building a directed graph comprising element names; corresponding elements names as nodes in the directed graph; forming arcs from every element parent node to every element child node of the element parent node; and checking for cycles in the directed graph. The system and method further comprise identifying all recursive cursor nodes and a recursive degree corresponding to the recursive shredding tree.Type: ApplicationFiled: December 16, 2005Publication date: June 21, 2007Applicant: International Business Machines CorporationInventors: Dikran Meliksetian, George Mihaila, Sriram Padmanabhan, Nianjun Zhou
-
Publication number: 20070118553Abstract: A tagging tree that defines a hierarchical output data structure and relational database query operations that retrieve the data to be included in each hierarchical section is accepted and processed. A query optimizer analyzes the tagging tree to determine database query operations that can be combined into a single query command. An outer-union query command is generated to allow efficient combination of multiple query commands, some of which are predicates to others. The tagging tree is modified to replace the database queries that were combined into the outer-union query to extract data from the results set produced by the outer-union query as opposed to submitting queries to the database manager. The optimized queries can be reused an arbitrary number of times to leverage the optimizing resources that were used in their creation.Type: ApplicationFiled: January 17, 2007Publication date: May 24, 2007Applicant: International Business Machines CorporationInventors: Nianjun Zhou, George Mihaila, Dikran Meliksetian, Sriram Padmanabhan
-
Patent number: 7219102Abstract: Tagging trees are generated and used to facilitate transforming data from relational databases into hierarchical formats, such as in XML documents. Tagging trees contain both XML hierarchical structure information as well a query information that is needed to access different data sources, e.g., databases, to retrieve the information to be placed in the hierarchical structure. A designer optionally creates a mapping script that specifies the transformation from relational databases to the hierarchical format. A tagging tree is created by either parsing that mapping script or by other means. A runtime environment then processes the tagging tree by a depth first traversal. The runtime environment is able to be configured to output a hierarchical data object, such as an XML document, or pipelined to control, for example, SAX processing.Type: GrantFiled: February 26, 2004Date of Patent: May 15, 2007Assignee: International Business Machines CorporationInventors: Nianjun Zhou, George Andrei Mihaila, Dikran S. Meliksetian, Sriram Padmanabhan
-
Patent number: 7185024Abstract: A tagging tree that defines a hierarchical output data structure and relational database query operations that retrieve the data to be included in each hierarchical section is accepted and processed. A query optimizer analyzes the tagging tree to determine database query operations that can be combined into a single query command. An outer-union query command is generated to allow efficient combination of multiple query commands, some of which are predicates to others. The tagging tree is modified to replace the database queries that were combined into the outer-union query to extract data from the results set produced by the outer-union query as opposed to submitting queries to the database manager. The optimized queries can be reused an arbitrary number of times to leverage the optimizing resources that were used in their creation.Type: GrantFiled: December 22, 2003Date of Patent: February 27, 2007Assignee: International Business Machines CorporationInventors: Nianjun Zhou, George Andrei Mihaila, Dikran S. Meliksetian, Sriram Padmanabhan
-
Patent number: 7174328Abstract: A method of utilizing one or more hints for query processing over a hierarchical tagged data structure having a plurality of nodes in a computing system having memory, the hint being positive if there is a tag accessible in top-down traversal from a child node, and otherwise negative. For each tag in the data structure, the method calculates a bitmap for a current node with all bits set to 1 and for each child node, followed by AND-ing all child bitmaps and setting a bit corresponding to a tag ID of a current tag to zero if such current tag exists. The method further sets a bit of a current tag to 0, calculates a plurality of possible non-redundant hints for each child node, and refreshes a hint list.Type: GrantFiled: September 2, 2003Date of Patent: February 6, 2007Assignee: International Business Machines Corp.Inventors: Ioana Stanoi, Christian Lang, Sriram Padmanabhan
-
Publication number: 20070020240Abstract: The invention provides therapeutic, defined-dose anti-bacterial phage preparations, methods to make such preparations, methods to treat bacterial infections using such preparations and methods to diagnose bacterial infections using such preparations.Type: ApplicationFiled: October 6, 2004Publication date: January 25, 2007Applicant: GangaGen, Inc.Inventors: M. Jayasheela, Bharathi Sriram, Sriram Padmanabhan
-
Publication number: 20060190425Abstract: Systems and methods for conducting attribute-based queries over a plurality of objects using bounded memory locations and minimizing costly input and output operations are provided. A plurality of attributes are associated with each object, and a plurality of data groups, one each for the identified attributes are created. The objects associated with the attributes are placed into the appropriate data groups, and the objects contained within each data group are sorted into blocks such that each block within a given attribute contains that objects having the same attribute value. Results to the query are created by loading blocks into a primary memory location in a middleware system and combining the loaded blocks to create the desire query results. Block combinations are created based upon the fit of the given block combination to the query as expressed in an aggregation function.Type: ApplicationFiled: February 24, 2005Publication date: August 24, 2006Inventors: Yuan-Chi Chang, Christian Lang, Apostol Natsev, Sriram Padmanabhan, Min Wang, Ioana Stanoi