Palantir Technologies Inc.

Google Inc.

Novellus Systems Incorporated

Lam Research Corporation

David Cohen

Michael Harris

Aravind Krishnaswamy

Michael Kross

Parvathy Menon

Adam Borochoff

Jack Grossman

Jason Ma

Matthew Sprague

Ilya Nepomnyashchiy

Bing Jie Fu

Steven Berler

Alex Smaliy

Julia Boortz

James Thompson

Stephen Freiberg

Kevin Zhang

Danielle Kramer

Robert Liu

Jeffrey Chen

Peter Wilczynski

Matthew Stephen Steiner

Erik Murphy-Chutorian

David Tobin

Alexander Landau

William Waldrep

Jason Hoch

Bryan Offutt

Andrew Israel

Landon Carter

Jonathan David Perlow

Todd Christopher Jackson

Shengyang Dai

Shinko Yuanhsien Cheng

Eric Charles Henry

Ivan Neulander

Jingyu Cui

Vincent Yanton Mo

Nicholas Butko

Flavio Lerda

Nir Ackner

Timothy Sepkoski St Clair

Khan Tasinga

Kevin Richards

Jay Steele

Andrew Elder

Allen Chang

John Kenneth Garrod

Sean Liu

Andrew Ames Bunner

Joel Ossher

Sharon Hao

Dhritiman Subha Kashyap

Alexander Mark

Timothy Yousaf

Edward Shichung Ho

John Pongsajapan

Ryan Zheng

James A Gallagher

Braden F Kowitz

Pavani Naishadh Diwanji

Nagarajan Kalyanasundaram

Jonathan McPhie

Chirag Shah

Christopher Richbourg

Alex M Cook, Iii

Michael H Leggett

Daniel Lidor

Joshua Zavilla

Henry Y Wong

Charles E Pomeroy

Christopher Gage

Matthew Avant

Karl Frederick Leeser

Bart Jan Van Schravendijk

Brett Rolston Lider

Kaihan Abidi Ashtiani

Sanjay Gopinath

Keith Jonathan Coleman

Matthew E Kulick

Frank Greer

Shambhu Nath Roy

Zachary Yeskel

Panya Wongsenakhum

Vivek Paul Gundotra

Kevin Courtney Smilak

Kathryn Chapman Cushing

Sooyun Joh

Edward J McInerney

Ajmal Asver

David Scrymgeour Bennett

Amar Gandhi

Vincent Burkhart

David Gary Besbris

Bart K Van Schravendijk

Simon Han

Michael Paul Davidson

Natan Solomon

Daniel Felix Pupius

Emily Chang

Systems and methods including a framework for migration of live data. The method may comprised, by one or more hardware processors executing program instructions, receiving, at a migration proxy of the framework, code for reading data and writing data compatible with each of a plurality of states of a migration of data in a data store, wherein a service is at least intermittently reading data from and writing data to the data store; determining, by a migration runner of the framework, to perform the migration of the data; initiating, by the migration runner, the migration of the data, wherein the migration comprises a plurality of stages; storing, as the migration progresses through the plurality of stages, and at a migration data store of the framework, a current stage of the migration; and during the migration, using the migration proxy to read data from and write data to the data store.

Framework for live data migration

A method comprises storing data objects in a non-graph data repository, each data object including a data source record; storing metadata of the data source records in a graph data repository, comprising transforming a reference in a first data object, which links the first data object to a second data object in the non-graph data repository, into a link node having a first edge connected to a first node representing the first data object and having a second edge connected to a second node representing the second data object, in the graph data repository; receiving a query for a shortest path between two specified nodes; executing the query on the graph data repository to obtain a result set; transforming the result set into a set of data objects in the non-graph data repository; providing the set of data objects, including the corresponding data source records, in response to the query.

Concurrent automatic adaptive storage of datasets in graph databases

Methods and apparatuses related to federated search of multiple sources with conflict resolution are disclosed. A method may comprise obtaining a set of data ontologies (e.g., types, properties, and links) associated with a plurality of heterogeneous data sources; receiving a selection of a graph comprising a plurality of graph nodes connected by one or more graph edges; and transforming the graph into one or more search queries across the plurality of heterogeneous data sources. A method may comprise obtaining a first data object as a result of executing a first search query across a plurality of heterogeneous data sources; resolving, based on one or more resolution rules, at least the first data object with a repository data object; deduplicating data associated with at least the first data object and the repository data object prior to storing the deduplicated data in a repository that has a particular data model.

Federated search of multiple sources with conflict resolution

Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as 'summaries' or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.

Phishing data item clustering and analysis

Techniques for improving database searches are described herein. In an embodiment, a computer-implemented data processing method comprises receiving a request to store a digital data object in a non-graph data repository, the data object comprising one or more first properties, the data object conforming to a first schema of the non-graph data repository; in response to the initiating, concurrently: digitally storing the data object in the non-graph data repository; transforming the data object into one or more nodes and edges of a graph; storing the one or more nodes and edges of the graph in a graph data repository that is separate from the non-graph data repository; electronically receiving a search query that specifies a path-based search; in response to receiving the search query: transforming the search query into a graph search query; submitting the graph search query to the graph data repository; receiving a result set of nodes from the graph data repository; transforming the result set of nodes into a set of corresponding data objects in the non-graph data repository; providing the set of corresponding data objects as output in a computer display.

Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as 'summaries' or 'conclusions') of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.

In an embodiment, a computer-implemented method comprises receiving a plurality of identifiers of first versions of electronic documents that have been stored in a distributed data storage system and queuing the identifiers in a queue table of a database; obtaining, from the queue table, a set of the identifiers of the first versions of the electronic documents; invoking, using the set of the identifiers, a query indexing function of a search engine system and receiving a set of matching identifiers of electronic documents, from among the set of identifiers, that match queries that have been registered using the query indexing function; storing the matching identifiers in a last-processed table; processing second versions of the electronic documents associated with the matching identifiers, using the query indexing function; updating a feed associated with a user account to show messages referring to the first versions of the electronic documents in response to determining that the second versions of the electronic documents do not match the queries.

Query indexing with permissions integration and federated search

A computer-based investigative analysis system is disclosed in which a user can share results of an investigation with other users in a way that allows the sharing user to visualize how the results will be shared before they are shared. The results are shared in the form of a visual graph having nodes, edges, and other presentation elements. The nodes represent data objects that are the subject of the investigation and the edges represent connections between the data objects. The graph is shared in the form of an automatically generated redacted graph omitting nodes, edges, and presentation elements for which the other users do not have permission to view. Before sharing the graph, the sharing user is presented with a visualization of the automatically generated redacted graph providing the user an opportunity to confirm that sharing the redacted graph will not constitute an unauthorized information leakage.

System and method for sharing investigation results

External malware data item clustering and analysis

Implementations for searching and analyzing large, object-oriented data sets in an efficient manner involving innovative user interface features and/or search algorithm functionality are disclosed. In one exemplary embodiment, a system may search for information and/or relationships based on specified search criteria and return results that may be displayed dynamically and further filtered or analyzed. Systems may involve object oriented database(s) and a software layer including a specialized user interface between the user and the database(s). The user interface may comprise various tools as well as predefined and configurable features that enable effective search of the data as well as display of search results that are configurable and readily managed to provide immediate and useful search results. The user interface may display the search results and various associated graphical representations and models, and/or provide tools enabling dynamic manipulation and display of search results or underlying object models, among other things.

Systems, methods, user interfaces and algorithms for performing database analysis and search of information involving structured and/or semi-structured data

A method includes grouping media items associated with a user into segments based on a timestamp associated with each media item and a total number of media items. The method also includes selecting target media from the media items for each of the segments based on media attributes associated with the media item. The method also includes generating a video that includes the target media for each of the segments by generating a first animation that illustrates a first transition from a first item from the target media to a second item from the target media with movement of the first item from an onscreen location to an offscreen location, wherein the first item is adjacent to the second item in the first animation and determining whether the target media includes one or more additional items. The method also includes adding a song to the video.

Generating videos of media items associated with a user

Growing community of inventors

Mountain View, CA, United States of America

David Cohen