Intel Corporation Jun 2014 - Jun 2015
Software Architect, Graph Analytics Operation
Intel Labs Jun 2014 - Jun 2015
Software Architect and Senior Software Engineer and Research Scientist
Intel Labs Aug 2013 - Jun 2014
Lead Software Engineer
Jenkon Nov 2010 - Aug 2013
Director of Development
Jenkon Jan 2006 - Nov 2010
Software Architect
Education:
Portland State University 2019 - 2024
Master of Science, Masters
Portland State University 2013 - 2017
Bachelors, Bachelor of Science, Mathematics
Rutgers University 1991 - 1994
Skills:
C# Linq .Net Microsoft Sql Server Asp.net Mvc Sql Javascript Java Asp.net Python C++ Soa Web Development Object Oriented Design Scrum Git Application Architecture Product Management Design Patterns Process Improvement Machine Learning Scala Powershell Technical Management Refactoring Redis Haskell User Interface Design Technical Training Windows Azure F# Sql Database Design Olap Optimization Technical Writing Public Speaking Visualization Mathematical Programming Abstract Algebra Topology Big Data Analytics Certified Scrum Master Csm Messaging Systems Akka Mpi Rust Agda Idris Coq Jquery Mercurial Uml
Interests:
Mathematics Clarity Software Design Algebraic Topology Category Theory Reading Programming Languages
- Santa Clara CA, US Soila P. Kavulya - Beaverton OR, US Bryn Keller - Vancouver WA, US Briton L. Barker - Hillsboro OR, US Kushal Datta - Beaverton OR, US Xia Zhu - Beaverton OR, US Theodore L. Willke - Tacoma WA, US
Assignee:
INTEL CORPORATION - Santa Clara CA
International Classification:
G06F 17/30
Abstract:
A system and method for orchestrating a table operation of data with a graph operation of the data using columnar stores. The orchestration includes storing vertices and edges as collections of tables by type, and supporting the columnar stores with different storage characteristics. The techniques may also include a graph query optimizer that combines chained operators of a graph query; and/or the graph query executed via an in-memory distributed query execution engine.
- Santa Clara CA, US Theodore L. Willke - Tacoma WA, US Bryn Keller - Vancouver WA, US Shih-Chi Chen - Portland OR, US Kushal Datta - Beaverton OR, US
Assignee:
Intel Corporation - Santa Clara CA
International Classification:
G06F 17/30
Abstract:
A method, computing system, and computer-readable medium for assigning global edge IDs for evolving graphs are described herein. The method includes selecting a block size for an evolving graph and, as new vertices are added to the evolving graph, calculating block IDs for the evolving graph. Calculating the block IDs includes creating a table representing the evolving graph and, as new vertices are added to the evolving graph, calculating block IDs for cells in a new column of the table before calculating block IDs for cells in a new row of the table. The method also includes calculating global edge IDs for the evolving graph based on the source vertex ID, the target vertex ID, and the block ID for the block at which each edge is located. The method may also include calculating incremental Page Rank for the evolving graph.