Search

Abhijeet Mohapatra Phones & Addresses

  • San Francisco, CA
  • Menlo Park, CA
  • Stanford, CA

Resumes

Resumes

Abhijeet Mohapatra Photo 1

Co-Founder And Chief Technology Officer

View page
Location:
214 Pine Hill Ct, Stanford, CA 94305
Industry:
Research
Work:
Symbium: the Computational Law Company
Co-Founder and Chief Technology Officer

Microsoft Jun 2009 - Sep 2009
Phd Research Intern

Cornell University May 2007 - Aug 2007
Undergraduate Research Intern

Ibm May 2006 - Aug 2006
Undergraduate Research Intern
Education:
Stanford University 2008 - 2014
Doctorates, Doctor of Philosophy, Computer Science, Philosophy, Logic
Indian Institute of Technology, Kharagpur 2004 - 2008
Bachelors, Bachelor of Technology, Computer Science, Engineering, Computer Science and Engineering
Kalinga Institute of Industrial Technology, Bhubaneswar
Bachelors
Bjb College
Skills:
Data Integration
Algorithms
Data Mining
Data Management
Column Stores
Database Compression
Query Optimization
C#
C++
Python
Optimization
Databases
Research
Simulations
Matlab
Computer Science
Interests:
Swimming
Digital Art
Painting (Water Color)
Basketball
Abhijeet Mohapatra Photo 2

Hardware Engineer

View page
Location:
San Francisco, CA
Industry:
Semiconductors
Work:
Park Controls & Communication (P) Ltd.
Hardware Engineer

Perfectus May 2008 - Jun 2009
Asic Design and Verification Engineer

Medha Servo Drives Pvt Ltd Sep 2006 - Apr 2008
Design Engineer
Education:
Utkal University
Bachelor of Engineering, Bachelors

Publications

Us Patents

Optimizing Fine Grained Access Control Using Authorization Indexes

View page
US Patent:
20120330925, Dec 27, 2012
Filed:
Jun 23, 2011
Appl. No.:
13/166828
Inventors:
Ravi Ramamurthy - Redmond WA, US
Raghav Kaushik - Bellevue WA, US
Abhijeet Mohapatra - Palo Alto CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707718, 707783, 707719, 707713, 707E17005, 707E17017
Abstract:
Architecture that is an index mechanism which optimizes complex queries that result from enforcing fine grained access control. The architecture addresses the problem of efficient query evaluation in the presence of fine grained access control. The index mechanism is a structure (referred to as authorization indexes) which provides expedient access to the authorized tuples of a particular user in a table. The index is maintained by utilizing view maintenance algorithms. The index can be built for only certain groups/roles (referred to as partial authorization indexes). Additionally, the authorization index can be used to create a cost-based query rewriter, as well as authorization-aware query optimizer.

Method And System For Database Storage Management

View page
US Patent:
20130097127, Apr 18, 2013
Filed:
Jul 12, 2012
Appl. No.:
13/548105
Inventors:
Abhijeet Mohapatra - Stanford CA, US
Michael Genesereth - Palo Alto CA, US
Assignee:
The Board of Trustees of the Leland Stanford Junior University - Palo Alto CA
International Classification:
G06F 17/30
US Classification:
707693
Abstract:
Embodiments of the present invention relate to run-length encoded sequences and supporting efficient offset-based updates of values while allowing fast lookups. In an embodiment of the present invention, an indexing scheme is disclosed, herein called count indexes, that supports O(log n) offset-based updates and lookups on a run-length sequence with n runs. In an embodiment, count indexes of the present invention support O(log n) updates on bitmapped sequences of size n. Embodiments of the present invention can be generalize to be applied to block-oriented storage systems.

Efficient Database Compression

View page
US Patent:
20120150877, Jun 14, 2012
Filed:
Dec 9, 2010
Appl. No.:
12/964549
Inventors:
Ravishankar Ramamurthy - Redmond WA, US
Abhijeet Mohapatra - Stanford CA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 17/30
US Classification:
707752, 707E17104
Abstract:
A method for compressing data. The method includes accessing, within an electronic system, a database relation comprising a plurality of attributes and determining a sort order of the plurality of attributes of the database relation. The method further includes determining an order of a plurality of compression operators operable to compress the database relation and compressing the database relation to produce a compressed database based on the sort order and the order of the plurality compression operators.
Abhijeet Mohapatra from San Francisco, CA, age ~38 Get Report