Search

Igor K Nazarenko

from Palo Alto, CA
Age ~48
Get Report
Related to:
Nina Khashchina, 49Irina Nazarenko, 70N Nazarenko
Connected to:
Andrew F Nazarenko, 74Andrey Nazarenko, 58Corazon D Nazareno, 71Justin Nazarenus, 32Lea C Nazareno, 37Luisa T Nazareno, 63Melanie A Nazareno, 60Sara Nazarenko, 40Susan G Nazareno, 59Alex Nazareth, 53

Igor Nazarenko Phones & Addresses

  • 777 San Antonio Rd, Palo Alto, CA 94303 (650) 213-8369
  • 765 San Antonio Rd APT 61, Palo Alto, CA 94303
  • 263 Waverly St, Sunnyvale, CA 94086 (408) 730-5819
  • 660 Gail Ave, Sunnyvale, CA 94086 (408) 730-5819
  • 3411 Irwin Ave, Bronx, NY 10463 (718) 548-1587
  • 263 Waverly St APT 2, Sunnyvale, CA 94086 (408) 509-3344

Work

Company: Google Sep 2011 Position: Swe

Education

Degree: MS School / High School: Kharkiv State University, Ukraine 1992 to 1997 Specialities: Mathematics

Skills

Algorithms • Distributed Systems • Databases • Python • Scalability • C++ • Linux • Software Engineering • Software Design • Big Data • Software Development • Java • High Performance Computing • Bioinformatics • Data Structures • Olap • System Design • Multithreading • Genome Sequencing • Dna Sequence Search

Languages

Russian

Emails

i***[email protected]

Industries

Computer Software

Resumes

Resumes

Igor Nazarenko Photo 1

Software Engineer

View page
Location:
701 south Santa Fe St, Pauls Valley, OK 73075
Industry:
Computer Software
Work:
Google since Sep 2011
SWE
Complete Genomics Aug 2007 - Aug 2011
Principal Software Engineer
Oracle Corporation Jul 2007 - Aug 2007
Architect
Hyperion Solutions Mar 2000 - Jun 2007
Distinguished Software Engineer
Profit Recovery Systems Nov 1998 - Jan 2000
Programmer/Analyst
Education:
Kharkiv State University, Ukraine 1992 - 1997
MS, Mathematics
Skills:
Algorithms
Distributed Systems
Databases
Python
Scalability
C++
Linux
Software Engineering
Software Design
Big Data
Software Development
Java
High Performance Computing
Bioinformatics
Data Structures
Olap
System Design
Multithreading
Genome Sequencing
Dna Sequence Search
Languages:
Russian

Business Records

Name / Title
Company / Classification
Phones & Addresses
Igor Nazarenko
Owner
Group Era
Commercial Art and Graphic Design
Po Box 1771, Cupertino, CA 95015
Website: groupera.com,
Igor Nazarenko
Owner
Project-Era
Real Estate Agent/Manager
Cupertino, CA 95015
Igor Nazarenko
Principal
Group Era
Real Estate Agent/Manager
20800 Homestead Rd, Cupertino, CA 95014
Igor Nazarenko
Owner
Group Era
Commercial Art and Graphic Design
Po Box 1771, Cupertino, CA 95015
Website: groupera.com,

Publications

Us Patents

Query Costing In A Multidimensional Database

View page
US Patent:
7392242, Jun 24, 2008
Filed:
Jun 7, 2004
Appl. No.:
10/863313
Inventors:
Jonathan M. Baccash - Sunnyvale CA, US
Igor Nazarenko - Sunnyvale CA, US
Uri Rodny - Mountain View CA, US
Ambuj Shatdal - Madison WI, US
Assignee:
Hyperion Solutions Corporation - Sunnyvale CA
International Classification:
G06F 7/00
G06F 17/30
US Classification:
707 3, 707 4, 707 5
Abstract:
The cost of running a query (having a query range) on a multidimensional database may be estimated using a process factors criteria beyond merely the number of affected records. First, a materialized view of the database may be represented as a container of tuples, sorted by key. Then keys may be stepped through, each key representing a mapping of a combination of tuples from the container. At each step, the process may request the next smallest key in the query range greater than or equal to the key of the current step, which results in the tuple in the database whose key is the smallest, greater than or equal to the requested key, and determine if the resulting tuple is in the query range. The cost of the query may then be estimated as the number of tuples upon which the range check was performed.

View Selection For A Multidimensional Database

View page
US Patent:
7467127, Dec 16, 2008
Filed:
Jun 7, 2004
Appl. No.:
10/863870
Inventors:
Jonathan M. Baccash - Sunnyvale CA, US
Igor Nazarenko - Sunnyvale CA, US
Uri Rodny - Mountain View CA, US
Ambuj Shatdal - Madison WI, US
Assignee:
Hyperion Solutions Corporation - Santa Clara CA
International Classification:
G06F 7/00
G06F 17/00
US Classification:
707 2
Abstract:
Selection of certain views of a multidimensional database to materialize may be accomplished using an efficient and effective solution. A set of all potential views may be stored in a structure. A path in the structure may then be traversed in an indicated direction through the structure, the path including two or more potential views and beginning at an indicated view. Then two or more immaterialized views in the path may be compared to each other to determine which immaterialized view is the optimum choice for maximizing benefit if selected to be materialized. Then the traversing and comparing may be continually iterated through, each iteration utilizing an indicated direction different than the last, each iteration also utilizing an indicated view set at the optimum choice determined by the last iteration, the iterating continuing until it converges on a single view. That single view may then be selected for materialization.

Method Of Splitting A Multi-Dimensional Cube Between A Multi-Dimensional And A Relational Database

View page
US Patent:
7716172, May 11, 2010
Filed:
Jan 30, 2006
Appl. No.:
11/343411
Inventors:
Vaishnavi Anjur - Belmont CA, US
Vijay K. Anjur - Sunnyvale CA, US
Hemanta Banerjee - San Jose CA, US
Maya Binkovich - Sunnyvale CA, US
Srinivas Duvvuri - Santa Clara CA, US
Mark Goldenshteyn - San Francisco CA, US
Arun Kumar - Fremont CA, US
Kevin Kaixuan Liao - San Jose CA, US
Igor Nazarenko - Sunnyvale CA, US
Assignee:
Hyperion Solutions Corporation - Sunnyvale CA
International Classification:
G06F 17/30
G06F 17/00
G06F 7/00
US Classification:
707600, 707809
Abstract:
A method of operating a multi-dimensional database is disclosed. In this method, a multi-dimensional portion of the data is transferred to a multi-dimensional database. A relational portion of the cube is kept in the relational database. When data from the relational portion needs to be accessed, the system produces the SQL queries to obtain data from the relational database.

Query Costing In A Multidimensional Database

View page
US Patent:
8019751, Sep 13, 2011
Filed:
Jun 23, 2008
Appl. No.:
12/143977
Inventors:
Jonathan M. Baccash - Sunnyvale CA, US
Igor Nazarenko - Sunnyvale CA, US
Uri Rodny - Mountain View CA, US
Ambuj Shatdal - Madison WI, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 7/00
US Classification:
707719, 707717, 707718, 707745
Abstract:
The cost of running a query (having a query range) on a multidimensional database may be estimated using a process factors criteria beyond merely the number of affected records. First, a materialized view of the database may be represented as a container of tuples, sorted by key. Then keys may be stepped through, each key representing a mapping of a combination of tuples from the container. At each step, the process may request the next smallest key in the query range greater than or equal to the key of the current step, which results in the tuple in the database whose key is the smallest, greater than or equal to the requested key, and determine if the resulting is in the query range. The cost of the query may then be estimated as the number of tuples upon which the range check was performed.

Oligomer Sequences Mapping

View page
US Patent:
8615365, Dec 24, 2013
Filed:
Feb 2, 2010
Appl. No.:
12/698965
Inventors:
Aaron L. Halpern - San Carlos CA, US
Igor Nazarenko - Sunnyvale CA, US
Assignee:
Complete Genomics, Inc. - Mountain View CA
International Classification:
G01N 33/48
G06F 19/00
US Classification:
702 19, 702 20
Abstract:
Mapping oligomer sequences includes receiving a set of related oligomer sequences, applying one or more key patterns derived from a set of oligomer sequence relationships to obtain one or more keys that are consistent with the set of related oligomer sequences, and locating the one or more keys in an index configured to map a plurality of possible keys to their respective candidate and/or validated locations in a reference.

Method Of Splitting A Multi-Dimensional Cube Between A Multi-Dimensional And A Relational Database

View page
US Patent:
20030182300, Sep 25, 2003
Filed:
Mar 19, 2002
Appl. No.:
10/101664
Inventors:
Vaishnavi Anjur - Belmont CA, US
Vijay Anjur - Sunnyvale CA, US
Hemanta Banerjee - San Jose CA, US
Maya Binkovich - Sunnyvale CA, US
Srinivas Duvvuri - Santa Clara CA, US
Mark Goldenshteyn - San Francisco CA, US
Arun Kumar - Fremont CA, US
Kevin Liao - San Jose CA, US
Igor Nazarenko - Sunnyvale CA, US
International Classification:
G06F007/00
US Classification:
707/102000
Abstract:
A method of operating a multi-dimensional database is disclosed. In this method, a multi-dimensional portion of the data is transferred to a multi-dimensional database. A relational portion of the cube is kept in the relational database. When data from the relational portion needs to be accessed, the system produces the SQL queries to obtain data from the relational database.

Indexing A Reference Sequence For Oligomer Sequence Mapping

View page
US Patent:
20100287165, Nov 11, 2010
Filed:
Feb 2, 2010
Appl. No.:
12/698986
Inventors:
Aaron L. Halpern - San Carlos CA, US
Igor Nazarenko - Sunnyvale CA, US
International Classification:
G06F 17/30
US Classification:
707741, 707E17002
Abstract:
Generating an index includes receiving a reference sequence and applying one or more key patterns to the reference sequence to obtain a plurality of keys in the index. Each of the one or more key patterns is derived based on a corresponding set of oligomer sequence relationships of a plurality of oligomer sequences that are expected to be generated from the reference, and the keys correspond to a plurality of candidate and/or validated locations in the reference sequence.

Method And System For Calling Variations In A Sample Polynucleotide Sequence With Respect To A Reference Polynucleotide Sequence

View page
US Patent:
20110004413, Jan 6, 2011
Filed:
Apr 29, 2010
Appl. No.:
12/770089
Inventors:
Paolo Carnevali - San Jose CA, US
Jonathan M. Baccash - Sunnyvale CA, US
Igor Nazarenko - Sunnyvale CA, US
Aaron L. Halpern - San Carlos CA, US
Geoffrey Nilsen - Palo Alto CA, US
Bruce Martin - Los Altos Hills CA, US
Radoje Drmanac - Los Altos Hills CA, US
Assignee:
COMPLETE GENOMICS, INC. - Mountain View CA
International Classification:
G06F 19/00
G01N 33/48
G06F 17/18
US Classification:
702 19, 702181
Abstract:
Embodiments for calling variations in a sample polynucleotide sequence compared to a reference polynucleotide sequence are provided. Aspects of the embodiments include executing an application on at least one computer that locates local areas in the reference polynucleotide sequence where a likelihood exists that one or more bases of the sample polynucleotide sequence are changed from corresponding bases in the reference polynucleotide sequence, where the likelihood is determined at least in part based on mapped mated reads of the sample polynucleotide sequence; generating at least one sequence hypothesis for each of the local areas, and optimizing the at least one sequence hypothesis for at least a portion of the local areas to find one or more optimized sequence hypotheses of high probability for the local areas; and analyzing the optimized sequence hypotheses to identify a series of variation calls in the sample polynucleotide sequence.
Control profile
Igor K Nazarenko from Palo Alto, CA, age ~48 Get Report