Alexander Irina Gorelik, Age 59Alamo, CA

Alexander Gorelik Phones & Addresses

Alamo, CA

289 Urbano Dr, San Francisco, CA 94127 (510) 703-1534

1521 Escobita Ave, Palo Alto, CA 94306 (650) 323-6396

44153 Boitano Dr, Fremont, CA 94539 (510) 438-0111 (510) 657-5547

Santa Clara, CA

Mountain View, CA

Work

Company: Smith, Currie & Hancock LLP Address:

Mentions for Alexander Irina Gorelik

Career records & work history

Lawyers & Attorneys

Alexander Gorelik Photo 1

Alexander Gorelik - Lawyer

Office:
Smith, Currie & Hancock LLP
ISLN:
1000168530
Admitted:
2017
University:
University of Maryland, B.A.
Law School:
The George Washington University Law School, J.D.

Alexander Gorelik resumes & CV records

Resumes

Alexander Gorelik Photo 16

Third Party Marketing For Alternative Investment Managers

Location:
3561 Farm Hill Blvd, Redwood City, CA 94061
Industry:
Investment Management
Work:
Loma Vista Partners since Jan 2010
Third Party Marketing for Alternative Investment Managers
Kestrel Investment Management Mar 2009 - Oct 2009
Marketing
Alpina Technologies Apr 2007 - Mar 2009
Director of Financial Planning and Analysis
Lend Lease 2005 - 2007
Finance Manager
Lakeview Capital Management 2003 - 2004
Consulting Associate
Jewish Federation of Chicago 2003 - 2003
Investment Intern
Midas Capital Management 1998 - 2001
Equity Research Analyst
Franklin 1996 - 1998
Management Program
Education:
The University of Chicago - Booth School of Business 2001 - 2003
MBA
Pomona College 1991 - 1995
Archbishop Mitty High School 1988 - 1991
Lynbrook High School 1987 - 1988
Alexander Gorelik Photo 17

Alexander Gorelik

Publications & IP owners

Us Patents

Method And Apparatus For Semantic Discovery And Mapping Between Data Sources

US Patent:
7426520, Sep 16, 2008
Filed:
Sep 9, 2004
Appl. No.:
10/938205
Inventors:
Alexander Gorelik - Fremont CA, US
Lingling Yan - San Jose CA, US
Assignee:
Exeros, Inc. - Santa Clara CA
International Classification:
G06F 17/00
US Classification:
707101, 707102, 707103 R, 7071041
Abstract:
An apparatus and method are described for the discovery of semantics, relationships and mappings between data in different software applications, databases, files, reports, messages, or systems. In one aspect, semantics and relationships and mappings are identified between a first and a second data source. A binding condition is discovered between portions of data in the first and the second data source. The binding condition is used to discover correlations between portions of data in the first and the second data source. The binding condition and the correlations are used to discover a transformation function between portions of data in the first and the second data source.

Method And System For Facilitating Data Retrieval From A Plurality Of Data Sources

US Patent:
7680828, Mar 16, 2010
Filed:
Aug 4, 2006
Appl. No.:
11/499442
Inventors:
Alexander Gorelik - Fremont CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 17/30
US Classification:
7071041, 707201, 715200
Abstract:
A method and a system for facilitating data retrieval from a plurality of data sources are provided. A plurality of ‘Local Data Objects’ (LDOs) corresponding to the plurality of data sources are generated. Further, the plurality of LDOs are mapped onto a ‘Global Data Object’ (GDO). The GDO consolidates the plurality of LDOs into a single integrated model. The mapping of the LDOs onto the GDO includes a plurality of ‘binding conditions’ that relate LDO attributes to GDO attributes. The mapping also includes a plurality of ‘transformation functions’ for transforming the LDO attributes to the GDO attributes.

Semantic Discovery And Mapping Between Data Sources

US Patent:
8082243, Dec 20, 2011
Filed:
Sep 12, 2008
Appl. No.:
12/283477
Inventors:
Alexander Gorelik - Palo Alto CA, US
Lingling Yan - Morgan Hill CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 17/00
US Classification:
707713, 707722, 707736, 707758, 707781, 707791
Abstract:
In one aspect, semantics and relationships and mappings are identified between a first and a second data source. Data between the first and second data source is compared. A binding condition is discovered between portions of data in the first and the second data source based upon the comparison, wherein the binding condition identifies data within the first and second data sources that map to each other. The binding condition is used to discover correlations between portions of data in the first and the second data source, wherein the correlations identify data in the first data source that correspond to values in the second data source. The binding condition and the correlations are used to discover a transformation function between portions of data in the first and the second data source, wherein the transformation function generates data in the second data source data in the first data source.

Searching And Displaying Data Objects Residing In Data Management Systems

US Patent:
8380750, Feb 19, 2013
Filed:
Feb 17, 2011
Appl. No.:
13/029454
Inventors:
Alexander Gorelik - Palo Alto CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 17/00
US Classification:
707802, 707791, 707822, 707828
Abstract:
A data source is accessed to provide information. The data source is accessed by defining a plurality of data objects each associated with data within the data source, where the data objects include search information that facilitates searching of the data objects, and the data objects further include display information that pertains to a format in which data obtained from a search of the data objects is displayed, defining one or more relationships linking at least one data object with at least one other data object so as to establish associated data objects with linking relationships, receiving a query to search for data within the data source, retrieving data within the data source satisfying the query in accordance with the search information, where the retrieved data comprises data from at least two associated data objects, organizing and displaying the retrieved data in accordance with the display information, and displaying one or more links associated with the retrieved data so as to enable navigation between associated data objects.

Semantic Discovery And Mapping Between Data Sources

US Patent:
8442999, May 14, 2013
Filed:
Oct 6, 2011
Appl. No.:
13/267292
Inventors:
Alexander Gorelik - Palo Alto CA, US
Lingling Yan - Morgan Hill CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 7/00
US Classification:
707791, 707688, 707694, 707696, 707802, 707822
Abstract:
An apparatus and method are described for the discovery of semantics, relationships and mappings between data in different software applications, databases, files, reports, messages, or systems. In one aspect, semantics and relationships and mappings are identified between a first and a second data source. A binding condition is discovered between portions of data in the first and the second data source. The binding condition is used to discover correlations between portions of data in the first and the second data source. The binding condition and the correlations are used to discover a transformation function between portions of data in the first and the second data source.

Nested Relational Data Model

US Patent:
2001004, Nov 29, 2001
Filed:
Feb 12, 2001
Appl. No.:
09/782186
Inventors:
Alexander Gorelik - Fremont CA, US
Sachinder Chawla - San Francisco CA, US
Awez Syed - Rockville MD, US
Leon Burda - Cupertino CA, US
Mon Yee - Sunnyvale CA, US
International Classification:
G06F015/00
US Classification:
707/514000
Abstract:
In a data processing system, hierarchical documents or hierarchical messages are mapped to a Nested Relational Data Model to allow for transformation and manipulation using declarative statements. The resulting nested data can be converted to a relational format and mapped to multiple relational tables, and/or converted from a nested relational format to an external hierarchical format, such as XML. The system can specify and execute declarative rules to extract, transform, integrate, load and update hierarchical and relational data. The system can also be used for extending documents with relational and non-relational data and applying updates based on these documents to relational database targets. The system can also be used for mapping Nested Relational Data to function calls that accept tables as parameters and return multiple scalar and table parameters as output.

High Availability Database System Using Live/Load Database Copies

US Patent:
2002000, Jan 10, 2002
Filed:
Feb 12, 2001
Appl. No.:
09/782178
Inventors:
Alexander Gorelik - Fremont CA, US
Leon Burda - Cupertino CA, US
International Classification:
G06F017/30
US Classification:
707/201000, 707/010000
Abstract:
In a computing system, wherein applications access databases to obtain data and the databases are updated from time to time and the applications require consistent data from the databases even while an update is occurring, a first database; a second database, wherein the first database and second database a substantive copies of each other outside of an update period; a database indicator that indicates one of the first and second databases as a live database and the other one of the first and second databases as a load database; a query router for routing queries from application to the live database; and a router switcher for switching the database indicator such that the live database becomes the load database and the load database becomes the live database.

Specification To Abap Code Converter

US Patent:
2005005, Mar 10, 2005
Filed:
May 25, 2004
Appl. No.:
10/854287
Inventors:
Sachinder Chawla - San Francisco CA, US
Jason Chen - Fremont CA, US
Alexander Gorelik - Fremont CA, US
Hon Thio - Castro Valley CA, US
Dave Wang - San Jose CA, US
Assignee:
ACTA TECHNOLOGY, INC. - Palo Alto CA
International Classification:
G06F009/44
US Classification:
717117000, 717151000, 717136000
Abstract:
A method of generating procedural language code for extracting data from a data warehouse comprising the steps of accepting a declarative specification and generating procedural language code to execute the declarative specification.

NOTICE: You may not use PeopleBackgroundCheck or the information it provides to make decisions about employment, credit, housing or any other purpose that would require Fair Credit Reporting Act (FCRA) compliance. PeopleBackgroundCheck is not a Consumer Reporting Agency (CRA) as defined by the FCRA and does not provide consumer reports.