CURRICULUM VITAE
CAREER OBJECTIVE
Qualification
|
Year of Passing
|
Institution
|
Percentage (%)
|
Board /
|
B.Tech (CSE)
|
2011
|
Kandula Obul Reddy Memorial College of
Engineering, Kadapa
|
71
|
JNTU, Anantapur
|
Intermediate
(M.P.C)
|
2007
|
Narayana Junior College, Kadapa
|
92
|
Board of
Intermediate Education, Hyderabad
|
X-Class
(SSC)
|
2005
|
Sree Swamy Vivekananda High School, Kadapa
|
83
|
Board of Secondary Education, Hyderabad
|
SAP - ABAP SKILLS
- Data
Dictionary:
Creation and Maintenance of Tables, Structures, Views and other Dictionary
Objects.
- Modularization
Techniques:
Includes, Subroutines, Function Modules, and Macro’s.
- Reports: Creation
of Classical, Interactive and ALV Reports.
- Module
Pool Programming: Knowledge in Module Pool Programming.
- LSMW: Uploading
data from legacy system to SAP system for various transactions.
- BDC: Conversion
of Non-SAP data in legacy system to SAP data for various Transactions by
using Call Transaction and Session Methods.
- Layout
Sets:
Creation of new SAP Scripts, Smart Forms and related control
programs and Modification of Standard SAP Scripts.
- Enhancements: Conceptual knowledge on User Exits and Badi’s to enhance the functionality of Standard R/3 Business Applications.
- Cross
Applications: Knowledge
on processing of IDOC’s, Setting Partner Profiles, knowledge on ALE
Configuration and creating RFC Connections.
- Conceptual knowledge on EDI
and BAPI.
- Performance
Tuning: Familiar with SQL
Trace and Run
Time Analysis.
- Menu
Painter:
Development of Menu interfaces for various Screens and Interactive lists.
- Screen
Painter:
Development of Screens for User-defined Transactions and writing of
associated Modules mainly for data entry in user-defined tables.
Project Title
|
BINRANK – Scaling Dynamic
Authority-Based Search Using Materialized Sub Graphs
|
Environment
|
JAVA, MySQL
|
Project Period
|
24-01-2011 TO 06-03-2011
|
Description
|
In
existing systems, Dynamic authority-based keyword search algorithms, such as Object
Rank, Personalized Page Rank etc., are used and require a query time Page
Rank-Style iterative computation over the full graph. This computation is too
expensive for large graphs and not feasible at query time.
Thus,
we introduce BINRANK, a web-based application acts as our own search engine system
that approximates object rank results by utilizing a hybrid approach inspired
by materialized views using sub graphs where query time can be trade off
between preprocessing time and storage. Our system solves the time consuming
problem in query execution.
|
Role
|
TEAM LEADER
|
Download Resume Format
0 comments:
Post a Comment