Abhijeet Mohapatra
CTO and Co-Founder
Symbium
Stanford University
abhijeet@stanford.edu
Projects and Applications
Symbium Plancheck. https://symbium.com/plancheck
Symbium Plancheck helps city planners conduct residential site plan reviews quickly, thoroughly, and consistently, leading to better customer service and more housing units approved in shorter periods of time. Plancheck produces a checklist of applicable zoning code regulations to review based on the project scope, indicates the required planning forms, and generates a comment letter.
Symbium Build. https://build.symbium.com
Symbium Build helps homeowners, design professionals, and planners quickly determine if an Accessory Dwelling Unit (ADU) is allowed on a property.
Worksheets. http://worksheets.stanford.edu
A platform that enables users to build worksheets i.e. create dynamic, interactive webpages in a DIY fashion (akin to creating spreadsheets).
Dexter. http://dexter.stanford.edu
A browser-based, domain-independent, (structured) data explorer.
Dexter's purpose is enabling end-users to explore accessible data (e.g. local files, public apis, accessible databases, webpages) in an ad-hoc, DIY fashion (e.g. Show me all senators who have a DUI record), to query the data with higher expressivity than that is directly supported by the data sources. Data processing in Dexter is carried out on the client side - because you love your data and we don't want it!
Merlin. https://stanford.edu/~abhijeet/merlin
A system to automatically design game visualizations.
Merlin's goal is to bring humans into the General Game Playing loop by providing different visualizations to play the games and strategize, and to help game artists to implove their game visualizations. Trifecta is a visualization of standard Tic-Tac-Toe that was generated by Merlin.
TPrime. http://logic.stanford.edu/tprime
A novel UI for browsing, and aggregating relational tables on smaller displays.
TPrime enables users to aggregate columns in a table by zooming out ( - ), or explore the aggregated values by zooming in ( + ). TPrime also enables organization of a table's content along different axes.
Research Publications
Australasian Joint Conference on AI, 2016
Abhijeet Mohapatra, Sudhir Agarwal, and Michael Genesereth
Global Conference on AI (GCAI), 2016
Abhijeet Mohapatra, Bertrand Decoster, Sudhir Agarwal, and Michael Genesereth
paper
AAAI Fall Symposium, 2016
Sudhir Agarwal, Abhijeet Mohapatra, and Michael Genesereth
Technical Report, 2015
Abhijeet Mohapatra
RuleML, 2015
Sudhir Agarwal, Abhijeet Mohapatra, and Michael Genesereth
Conference on Innovative Database Systems Research (CIDR), 2015
Abhijeet Mohapatra, Ravishankar Ramamurthy, and Raghav Kaushik
Sources in Your BrowserAAAI Workshop on Semantic Cities, 2014
Abhijeet Mohapatra, Sudhir Agarwal, and Michael Genesereth
Foundations of Information and Knowledge Systems (FoIKS), 2014
Abhijeet Mohapatra, and Michael Genesereth
Maintain Aggregate Views Logic for Programming, AI and Reasoning (LPAR), 2013
Abhijeet Mohapatra, and Michael Genesereth
Views Symposium on Abstraction, Reformulation, and Approximation (SARA), 2013
Abhijeet Mohapatra, and Michael Genesereth
Technical Report, 2012
Abhijeet Mohapatra, and Michael Genesereth
Encoded Attributes in Column Stores International Database Engineering and Applications Symposium (IDEAS), 2012
Abhijeet Mohapatra, and Michael Genesereth
Technical Report, 2009
Abhijeet Mohapatra
Undergraduate Thesis, 2008
Abhijeet Mohapatra
Advisor: P. P. Chakrabarti
Capturing safety properties of stream queries in a temporal logic framework
Indian Academy of Sciences Fellowship, 2006
Abhijeet Mohapatra, R. K. Shyamasundar
Inventor Profile
A technique to incrementally update compressed relations in column stores. A compressed attribute is updated in time that is logarithmic in the number of the distinct values of that attribute. Batch updates can be performed in time that is constant per updated tuple. No technique can perform faster updates in an asymptotic sense.
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.
A method for compressing a database relation by leveraging an optimal ordering of tuples and composition of compression operators.
Internships
Microsoft Research, Redmond, Summer 2010
Supervisor: Ravishankar Ramamurthy
- Proposed and implemented a mechanism to optimize fine-grained access control in database queries. For a variety of authorization policies, an order of magnitude speed-up was observed on TPC-H benchmark. (USPTO#: 20120330925)
Microsoft Research, Redmond, Summer 2009
Supervisor: Ravishankar Ramamurthy
- Proposed and implemented an extensible framework to compress database relations by composing compression techniques. The compression achieved on syntenthic as well as real datasets using our framework was an order of magnitude larger than state-of-art compressors such as WinZip and xMill. (USPTO#: 20120150877)
DB Group, Cornell University, Summer 2007
Supervisors: Johannes Gehrke, Al Demers and Walker White
- Proposed a novel architecture which decouples the sequencial modules in a traditional game loop.
- Proposed a new algorithm for collision-free navigation in crowd simulations.
Supervisor: R. K. Shyamasundar
- Developed a formal model to answer continuous queries on complex event streams in the temporal logic framerwork of Lustre.
Teaching
Logic and Collaboration for Intelligent Applications
2017
Stanford Computation + Journalism Symposium
2016
VisualizationsGeneral Game Playing Competition, AAAI
2015
Trifecta Game
Browser with DexterStanford CS Annual Affiliates Meeting
2014
DepartmentStanford CS Annual Affiliates Meeting
2013
StoresStanford CS Annual Affiliates Meeting
2012
CS 322, Supervisor: Jure Leskovec
CS 345A, Supervisor: Jeffrey D. Ullman
Analysis of Netflix Data