George A Mihaila, 571724 Central St, Yorktown Heights, NY 10598

7219102, May 15, 2007

Feb 26, 2004

10/788141

Nianjun Zhou - Somers NY, US
George Andrei Mihaila - Yorktown Heights NY, US
Dikran S. Meliksetian - Danbury CT, US
Sriram Padmanabhan - San Jose CA, US

International Business Machines Corporation - Armonk NY

G06F 17/00
G06F 17/30

707101, 707 3

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.

7313563, Dec 25, 2007

Jul 30, 2003

10/629744

Rajesh Bordawekar - Yorktown Heights NY, US
Yi Chen - Philadelphia PA, US
George A. Mihaila - White Plains NY, US
Sriram Padmanabhan - Briarcliff Manor NY, US

International Business Machines Corporation - Armonk NY

G06F 7/00
G06F 17/00

707101, 707100, 715513, 715514

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.

7418453, Aug 26, 2008

Jun 15, 2006

11/455299

Pawan R. Chowdhary - Montrose NY, US
Hui Lei - Scarsdale NY, US
George Andrei Mihaila - Yorktown Heights NY, US
Themis Palpanas - Dobbs Ferry NY, US

International Business Machines Corporation - Armonk NY

G06F 7/00
G06F 17/00

707100, 707101

A method, information processing system, and computer readable medium for modifying at least one data warehouse schema based on detected changes in an associated observation model are disclosed. The method includes determining if at least one new observation model has been created. The method also includes determining if at least one existing observation model is associated with the new observation model. In response to the existing observation model being associated with the new observation model, at least one changed attribute is identified by comparing the new observation model and the existing observation model. A set of files associated with the existing observation model is updated to reflect the changed attribute between the new observation model and the existing observation model.

7469249, Dec 23, 2008

Mar 8, 2004

10/795534

George Andrei Mihaila - Yorktown Heights NY, US
Sriram Padmanabhan - San Jose CA, US
Oded Shmueli - Nofit, IL

International Business Machines Corporation - Armonk NY

G06F 17/00

707100, 707 1, 707 10, 707102, 7071041, 707203

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.

7472108, Dec 30, 2008

May 16, 2006

11/435353

Lipyeow Lim - North White Plains NY, US
George Andrei Mihaila - Yorktown Heights NY, US
Min Wang - Cortlandt Manor NY, US

International Business Machines Corporation - Armonk NY

G06F 17/30
G06F 12/00

707 2, 707 1, 707 3, 707103 R, 707103 Y, 707205

A method for collecting statistics associated with data in a database are disclosed. The method comprises determining an amount of memory needed to collect statistics for data associated with a defined data type in a relational database. The defined data type is based upon a mark-up language using a tree structure with one or more root-to-node paths therein. The amount of memory is allocated as determined for collecting the statistics for the data of the defined data type. A statistics collection is performed for the data of the defined data type in a single pass through the database and within the amount of memory which has been allocated. The performing includes at least determining a total number of instances of at least one path-identifier associated with a given value within a given set of documents.

7483890, Jan 27, 2009

Jan 17, 2007

11/623840

Nianjun Zhou - Somers NY, US
George Andrei Mihaila - Yorktown Heights NY, US
Dikran S. Meliksetian - Danbury CT, US
Sriram Padmanabhan - San Jose CA, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707 4

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.

7496683, Feb 24, 2009

Jul 27, 2006

11/494331

Christian A. Lang - New York NY, US
George Andrei Mihaila - Yorktown Heights NY, US
Themis Palpanas - Dobbs Ferry NY, US
Ioana Stanoi - White Plains NY, US

International Business Machines Corporation - Armonk NY

G06F 15/173

709241, 709232, 709238

A system, method, and computer readable medium for optimizing throughput of a stream processing system are disclosed. The method comprises analyzing a set of input streams and creating, based on the analyzing, an input profile for at least one input stream in the set of input streams. The input profile comprises at least a set of processing requirements associated with the input stream. The method also comprises generating a search space, based on an initial configuration, comprising a plurality of configurations associated with the input stream. A configuration in the plurality of configurations is identified that increases throughput more than the other configurations in the plurality of configurations based on at least one of the input profile and system resources.

7499927, Mar 3, 2009

Feb 24, 2005

11/065024

George Andrei Mihaila - Yorktown Heights NY, US
Ioana Roxana Stanoi - White Plains NY, US

International Business Machines Corporation - Armonk NY

G06F 7/00
G06F 17/00

707100, 707 1, 711152

A computer-implemented method is provided for performing key lookups. The method comprises accessing a header of a given one of a plurality of nodes in a tree-based data index structure. The given node comprises the header and a plurality of partitions. Each partition comprises at least one key. The header of the given node comprises a selected key from each of a selected plurality of the partitions. The method also comprises choosing, using a search key, a selected key in the header. The method further comprises accessing a partition corresponding to the chosen selected key and selecting, using the search key, one of the at least one keys in the accessed partition. The selected one of the at least one keys can be used to access another of the plurality of nodes. Yet additional methods, apparatus, and program products are disclosed.