Search

Fatma Ozcan

from San Jose, CA
Age ~51
Get Report
Also known as:
Fatma O Altinel, Satma Ozcan
Phone and address:
1120 Mallard Ridge Loop, San Jose, CA 95120
(408) 250-4757
Related to:
Mehmet AltinelMehmet Altinel, 54Nehnet Altinel
Connected to:
Cengiz Ozcan, 72Erkan Ozcan, 39Ersin Ozcan, 44Fadime Ozcan, 50Hakan Ozcan, 46Hatice Ozcan, 40Nihan Ozcan, 37Suat A Ozcan, 58Suleyman O Ozcan, 43Ece A Ozcelik, 36

Fatma Ozcan Phones & Addresses

  • 1120 Mallard Ridge Loop, San Jose, CA 95120 (408) 250-4757
  • 1035 Coleman Ave, San Jose, CA 95123 (408) 323-9001
  • Roseville, CA
  • Gaithersburg, MD
  • College Park, MD

Work

Company: Ibm almaden research center Sep 2001 Position: Research staff member

Education

Degree: PhD School / High School: University of Maryland College Park 1997 to 2001 Specialities: Computer Science

Skills

Databases • Data Warehousing • Data Management • Query Optimization • Xquery • Xml Databases • Sql • Distributed Systems • Distributed Databases • C++ • Hadoop • Mapreduce • Big Data • Db2 • Xml • Analytics • Computer Science • Algorithms • High Performance Computing • Linux • Software Engineering • Software Development • Perl • Unix • Artificial Intelligence • Object Oriented Design • Machine Learning • Data Mining • Java • Shell Scripting • Software Design • Eclipse • Soa • Text Mining • Python • Information Retrieval • Pattern Recognition • Scalability • Natural Language Processing

Languages

English • Turkish

Industries

Research

Resumes

Resumes

Fatma Ozcan Photo 1

Principal Software Engineer

Location:
1120 Mallard Ridge Loop, San Jose, CA 95120
Industry:
Research
Work:
IBM Almaden Research Center since Sep 2001
Research Staff Member
University of Maryland, College Park Sep 1997 - Aug 2001
Research Assistant
IBM Almaden Research Center May 1999 - Aug 1999
Research Intern
IBM Almaden Research Center May 1998 - Aug 1998
Research intern
Middle East Technical University, Ankara Sep 1994 - Aug 1997
Research Assistant
Education:
University of Maryland College Park 1997 - 2001
PhD, Computer Science Middle East Technical University 1990 - 1996
M.S, Computer Engineering Orta Doğu Teknik Üniversitesi 1990 - 1994
B.S, Computer Engineering Malatya Fen Lisesi 1987 - 1990
Skills:
Databases
Data Warehousing
Data Management
Query Optimization
Xquery
Xml Databases
Sql
Distributed Systems
Distributed Databases
C++
Hadoop
Mapreduce
Big Data
Db2
Xml
Analytics
Computer Science
Algorithms
High Performance Computing
Linux
Software Engineering
Software Development
Perl
Unix
Artificial Intelligence
Object Oriented Design
Machine Learning
Data Mining
Java
Shell Scripting
Software Design
Eclipse
Soa
Text Mining
Python
Information Retrieval
Pattern Recognition
Scalability
Natural Language Processing
Languages:
English
Turkish

Publications

Isbn (Books And Publications)

Heterogeneous Agent Systems

Author

Fatma Ozcan

ISBN #

0262194368

Us Patents

Xpath Containment For Index And Materialized View Matching

US Patent:
7315852, Jan 1, 2008
Filed:
Oct 31, 2003
Appl. No.:
10/698622
Inventors:
Audrey L. Balmin - San Diego CA, US
Kevin S. Beyer - San Jose CA, US
Roberta Jo Cochrane - Los Gatos CA, US
Fatma Ozcan - San Jose CA, US
Mir Hamid Pirahesh - San Jose CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 17/30
US Classification:
707 3, 707 4, 707 5, 707 6
Abstract:
A method for using pre-computed information stored in auxiliary structures to speed up processing of expensive queries on hierarchical documents such as XML documents being queried using XPath. The invention defines a taxonomy of such structures such as indexes and materialized views for storing pre-computed XPath results (PXRs), determines what portion of the query can be evaluated by the structures, and computes the compensation for the results generated by the structures. The invention detects all structures applicable to the query and rewrites the query to use such structures, speeding up the performance of the queries. The invention identifies the matching structures by detecting containment mappings between XPath expressions in the query and the structure. The invention also includes a new representation for XPath expressions that is rich enough to express all features of XPath.

Method And Apparatus For Xml Query Evaluation Using Early-Outs And Multiple Passes

US Patent:
7716210, May 11, 2010
Filed:
Dec 20, 2006
Appl. No.:
11/613944
Inventors:
Fatma Ozcan - San Jose CA, US
Edison Lao Ting - San Jose CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 17/30
US Classification:
707713, 707718, 707759, 707765
Abstract:
A method and apparatus is disclosed for XML query evaluation using early-outs and multiple passes to evaluate an XML query. A multi-pass evaluation procedure evaluates the XML query one step at a time as needed to complete evaluation. The multi-pass evaluation procedure evaluates XML queries containing logical expressions such as “AND” expressions, “OR” expressions, and implied “AND” expressions within “FOR” clauses. Queries containing logical expressions are often satisfied before every component is evaluated. Thus, executing the multi-pass evaluation procedure allows the evaluation to exit early when the veracity of the query is determined, not necessarily when every component has been evaluated. The multi-pass evaluation procedure executes as long as a descendant axis of the XML query need not be evaluated past a child node. When evaluation of a descendant axis past a child node is required, the multi-pass evaluation procedure may switch to a single-pass evaluation procedure to complete evaluation.

Optimization Of Extensible Markup Language Path Language (Xpath) Expressions In A Database Management System Configured To Accept Extensible Markup Language (Xml) Queries

US Patent:
7865502, Jan 4, 2011
Filed:
Apr 10, 2008
Appl. No.:
12/101141
Inventors:
Andrey Balmin - San Jose CA, US
Fatma Ozcan - San Jose CA, US
Tam Minh Dai Tran - San Jose CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 7/00
US Classification:
707713, 707714
Abstract:
An apparatus, system, and method are disclosed for optimization of XPath expressions in a database management system configured to accept XML queries. Operations of the method include receiving an XQuery representation and partitioning XPath expressions within the XQuery representation into a plurality of XPath expression clusters. The XPath expression clusters may comprise one or more XPath expressions and those in each cluster may operate on a common document. Furthermore, the XPath expressions in each cluster are hierarchically related to each other such that branch nodes of the cluster are executable independent of nodes in other XPath expression clusters. The method also defines merging the one or more XPath expressions into one or more expression trees for each XPath expression cluster. The method generates one or more query execution plans from the one or more XPath expression blocks. The method includes, for each query execution plan, splitting each of the XPath expression blocks into one or more ordered fragments.

Context Quantifier Transformation In Xml Query Rewrite

US Patent:
20050108209, May 19, 2005
Filed:
Nov 19, 2003
Appl. No.:
10/717870
Inventors:
Kevin Beyer - San Jose CA, US
Roberta Cochrane - Los Gatos CA, US
Fatma Ozcan - San Jose CA, US
Normen Seemann - Cupertino CA, US
International Classification:
G06F007/00
US Classification:
707003000
Abstract:
An XML query compilation processor () includes an execution compiler () that transforms an XML query into an executable XML query plan (). A query rewrite processor () performs query transformations on the XML query. Said query transformations include transforming an expression input () received by an expression () conditional upon a set of items defined by an output () of the expression () being independent of grouping of items in the expression input ().

Join Algorithms Over Full Text Indexes

US Patent:
20110184933, Jul 28, 2011
Filed:
Jan 28, 2010
Appl. No.:
12/696013
Inventors:
Latha Sankar Colby - Sunnyvale CA, US
Quanzhong Li - San Jose CA, US
Fatma Ozcan - San Jose CA, US
Mir Hamid Pirahesh - San Jose CA, US
Eugene J. Shekita - San Jose CA, US
Zografoula Vagena - London, GB
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 17/30
US Classification:
707714, 707E17054
Abstract:
According to one embodiment of the present invention, a method for processing join predicates in full-text indexes is provided. The method includes evaluating local predicates of an outer full text index to generate a first posting list of documents. For each document in the first posting list, the value of a join attribute is determined and an inner full text index is probed to obtain a second posting list of documents containing one of the join attributes determined for each document. Local predicates of an inner full text index are evaluated to generate a third posting list of documents, and the second posting list is merged with the third posting list to generate a merge list of documents. Documents in the first posting list may be paired up with documents in the merge list.

Guided Exploration For Conversational Business Intelligence

US Patent:
20220277031, Sep 1, 2022
Filed:
Mar 1, 2021
Appl. No.:
17/188405
Inventors:
- Armonk NY, US
Fatma OZCAN - San Jose CA, US
Chuan LEI - CUPERTINO CA, US
Vasilis EFTHYMIOU - San Jose CA, US
Venkata Vamsikrishna MEDURI - Mesa AZ, US
International Classification:
G06F 16/332
G06N 20/00
Abstract:
A computing device and computer-implemented method to provide access to business intelligence data via a conversational interface is described. The method begins with receiving prior user interactions based on corresponding pairs of user queries and computing device responses, with the conversational interface. Received also is a business intelligence ontology and access to a conversational space structure for the conversational interface. The computing device executes a machine learning model based upon the prior user interactions, business intelligence ontology, and the conversational space structure to predict possible next queries. The possible next queries are sent to a user. In one example, the computing device receives a user query, which is in addition to the prior user interactions with the conversational interface. A response to the query is generated. The response to the query is sent to the user prior to sending the possible next queries, which have been predicted.

Conversation Based Data Analysis Recommendations

US Patent:
20220237232, Jul 28, 2022
Filed:
Jan 28, 2021
Appl. No.:
17/160630
Inventors:
- Armonk NY, US
Fatma Ozcan - San Jose CA, US
Eser Kandogan - Mountain View CA, US
Jung-Lin Lee - El Dorado Hills CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 16/9032
G06F 16/9035
Abstract:
An insight comprising a fact about a portion of data in a dataset is detected in the dataset. A context is determined by analyzing a natural language input, the context identifying an intent and an entity referenced by the natural language input. A relevance score is computed for the insight, the relevance score comprising a measure of similarity between a vector representation of the insight and a vector representation of the context, the vector representation of the insight comprising an encoding of the insight in multidimensional numerical form, the vector representation of the context comprising an encoding of the context in multidimensional numerical form. A selected insight is presented, the selected insight selected from a set of insights including the insight, the selected insight selected based on the relevance score.

Hybrid Graph Neural Network

US Patent:
20220237446, Jul 28, 2022
Filed:
Jan 28, 2021
Appl. No.:
17/161093
Inventors:
- Armonk NY, US
Junheng Hao - Los Angeles CA, US
Vasilis Efthymiou - San Jose CA, US
Fatma Ozcan - San Jose CA, US
Abdul Quamar - San Jose CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06N 3/08
G06F 16/28
G06N 3/04
Abstract:
An embodiment includes generating a first concept representation based on a first portion of a knowledge base using a first processing path of a neural network that includes a hyperbolic graph convolution layer. The embodiment also includes generating a second concept representation based on a second portion of the knowledge base using a second processing path of the neural network, the second processing path comprising a heterogenous graph convolution layer. The embodiment also includes generating a unified concept representation including concatenating the first concept representation with the second concept representation. The embodiment also includes generating a prediction score using a using a predictive matching module, where the predictive score is indicative of an extent of a match between the unified concept representation and a concept representation from a second knowledge base.
Control profile
Fatma Ozcan from San Jose, CA, age ~51 Get Report