Ibm
Big Data Solutions Architect
Ibm 2008 - Oct 2010
Architect - Data Studio Enablement
Ibm Jan 2000 - Oct 2010
Development Manager
Education:
Binghamton University 1978 - 1980
Masters, Computer Science
Skills:
Db2 Data Warehousing Enterprise Architecture Solution Architecture Data Modeling Unix Soa Business Intelligence Software Development Databases Etl Architecture Oracle Big Data Analytics Ibm Biginsights Performance Tuning Agile Methodologies Ibm Db2 Aix Websphere Architectures Database Design High Availability Hadoop System Administration Ibm Aix Service Oriented Architecture Windows
Roberta Jo Cochrane - Los Gatos CA George Lapis - San Jose CA Ting Yu Leung - San Jose CA Mir Hamid Pirahesh - San Jose CA Monica Sachiye Urata - Saratoga CA Richard Sefton Sidle - Mountain View CA David E. Simmen - San Jose CA Calisto Paul Zuzarte - Pickering, CA
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1730
US Classification:
707 2, 707 3, 707 4, 707 10, 707100, 707104
Abstract:
A method, apparatus, and article of manufacture for optimizing database queries using a materialized view for a table referenced in the query, wherein the materialized view has different properties than the referenced table. The materialized view may be replicated across multiple processors of the computer system, so that some or all of the query can be executed in a local fashion wherein there is no data movement required to perform the operations. The materialized view also may be partitioned across multiple processors of the computer system using a different partitioning key than the referenced table. The materialized view may be a vertical and/or horizontal subset of the table, so that only selected columns and/or tuples from the table are present therein. Columns may be added to the materialized view to contain pre-computed results of complex expressions, and indices may be created on the columns of the materialized view.
Efficient Implementation Of Typed View Hierarchies For Ordbms
Michael J. Carey - San Jose CA George Lapis - San Jose CA Mir Hamid Pirahesh - San Jose CA Serge P. Rielau - Ajax, CA Bennet Vance - San Jose CA
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1730
US Classification:
707 2, 707 1, 707 5, 707 3, 707 10, 707104
Abstract:
A method for typed view hierarchies for an object-relational database management (OPDBMS). The views in the hierarchy are merged into a unified hierarchy view through case expressions for mapping and wrapping of overloaded columns. During the merge, the underlying logical tables are eliminated which results in a simplified query graph. The transformation is a non-loss operation which condenses the type information within the case expressions. This allows update, delete and insert operations to be resolved on the query graph on a local level. Using query rewrite rules, the case expressions may be simplified further.
Automatic Recognition And Rerouting Of Queries For Optimal Performance
Roberta Jo Cochrane - Los Gatos CA George Lapis - San Jose CA Ting Yu Leung - San Jose CA Mir Hamid Pirahesh - San Jose CA Monica Sachiye Urata - Saratoga CA
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1730
US Classification:
707 2, 707 3, 707 4
Abstract:
A method, apparatus, and article of manufacture for optimizing database queries uses a derived summary table, wherein a definition of the summary table is based on a full select statement that is materialized in the table and describes how the summary table was derived. The summary table definition can be a complex query involving nested GROUP BY operations as well as complex HAVING clauses with subqueries or join operations. A query is analyzed using subsumption tests between the query and the definition of the summary table to determine whether expressions occurring anywhere in the query, but not in the summary table, can be subsumed in the summary table. In performing the query, an expression in the query is subsumed in the summary table when the expression can be re-derived from one or more of the columns of the summary table.
Cube Indices For Relational Database Management Systems
Roberta Jo Cochrane - Los Gatos CA George Lapis - San Jose CA Ting Yu Leung - San Jose CA Mir Hamid Pirahesh - San Jose CA Yang Sun - Sunnyvale CA Markos Zaharioudakis - San Jose CA
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 700
US Classification:
707 2, 707 3
Abstract:
A method, apparatus, and article of manufacture for optimizing database queries using subsumption tests between the query and at least one summary table that comprises a cube index to determine whether an expression in the query can be subsumed in the summary table. The summary table stores at least one materialized view involving at least one GROUP BY operation that computes at least one of the following: (1) a cube, (2) a rollup, (3) a grouping set, and (4) a concatenation of cubes, rollups, grouping sets, and one or more grouping items. When the expression in the query can be subsumed in the summary table, the query is rewritten to use the summary table.
Platform-Independent Method And System For Graphically Presenting The Evaluation Of A Query In A Database Management System
Tanya Couch - San Jose CA Stefan Bengt Edlund - San Jose CA George Lapis - San Jose CA Guy Maring Lohman - San Jose CA Berthold Reinwald - Los Gatos CA
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1730
US Classification:
707 2, 707102
Abstract:
A method and system for graphically representing a plan for a query in a relational database management system is disclosed. The method includes receiving and processing an input query to form a plurality of plans, selecting at least one plan of the plurality of plans, and transforming the selected plan into a self-describing formatted file which is platform independent. The method further includes generating a graph representing the selected plan from the self-describing formatted file.
Analyzing, Optimizing And Rewriting Queries Using Matching And Compensation Between Query And Automatic Summary Tables
Roberta Jo Cochrane - Los Gatos CA, US George Lapis - San Jose CA, US Ting Yu Leung - San Jose CA, US Mark A. Paskin - San Pablo CA, US Mir Hamid Pirahesh - San Jose CA, US Yang Sun - Sunnyvale CA, US Monica Sachiye Urata - Saratoga CA, US Markos Zaharioudakis - San Jose CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1730
US Classification:
707 4, 707 2, 707 3, 707 5
Abstract:
A method, apparatus, and article of manufacture for optimizing database queries using a derived summary table, wherein a definition of the summary table is based on a full select statement, including, but not limited to, a derived table involving nested GROUP BY operations and complex HAVING clauses with subqueries or joins, that is materialized in the table and describes how the summary table was derived. A query is analyzed using matching/compensation tests between the query and the definition of the summary table (that is, a query by itself) to determine whether expressions occurring anywhere in the query, but not in the summary table, can be derived using either the content in the summary table alone, or after combining (through some relational operator) the content of the summary table with other base tables, and hence the query is subsumed by or overlaps with the summary table definition.
Classification Of Data For Insertion Into A Database
Serge Rielau - Ajax, CA Roberta J. Cochrane - Los Gatos CA, US George Lapis - San Jose CA, US Hamid Pirahesh - San Jose CA, US Richard S. Sidle - Mountain View CA, US Biao Zhu - Toronto, CA
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 12/00 G06F 17/30
US Classification:
707204, 707201
Abstract:
A method and system for use in a computing environment for selecting a subset of records from a set of records for placement of the subset of records in a plurality of destinations. A group of replica records is formed for a record of the subset of records, and a destination identification is assigned to each replica record, except one, of the group of replica records. A replica record associated with one of the plurality of destinations can be selected and can be placed in the associated destination.
Matching And Compensation Tests For Optimizing Correlated Subqueries Within Query Using Automatic Summary Tables
Markos Zaharioudakis - Los Gatos CA, US Mir Hamid Pirahesh - San Jose CA, US Roberta Jo Cochrane - Los Gatos CA, US George Lapis - San Jose CA, US Yang Sun - Morgan Hill CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 17/30
US Classification:
707 2, 707 5
Abstract:
A method, apparatus, and article of manufacture for optimizing database queries using an automatic summary table. A query is analyzed using matching and compensation tests between the query at least one correlated subquery within the query and the automatic summary table to determine whether expressions occurring in the query, but not in the automatic summary table, can be derived using the automatic summary table. If so, the query is rewritten so that the automatic summary table is used.
Sep 29, 2010 ... What George Lapis is saying about this Meetup Group. George Lapis has not left a group review yet. Click here to read other members' group ...
Flickr
Youtube
George Steve suniverse. Farts amethyst VS...
Duration:
26s
George Lapis.MP4
George Mihos on stage at Success Summit.
Duration:
24s
Nightmare on Elm Street. New evidence of the ...
"The Antichrist came in the door the day #JohnFKennedy was murdered. I...
Duration:
21m 14s
The History of Lapis Lazuli
GO BUY MERCH! : This is a short clip from a video...
Duration:
10s
Lapis Exillis - The Stone Is The Grail - Thea...
SEE WHAT'S NEW at UFOTV ALL ACCESS - COMMERCIAL FREE WITH YOUR SUPPORT...