Afshin Ganjoo Ganjoo

US Patent:

20060294126, Dec 28, 2006

Filed:

Jun 23, 2005

Appl. No.:

11/165791

Inventors:

Afshin Ganjoo - San Jose CA, US

International Classification:

G06F 7/00

US Classification:

707101000

Abstract:

A method and system for homogeneous hashing is described. The method includes hashing data into a hash table using a first hash function and determining one or more subsequent hash functions to be used for one or more cells of the hash table. The subsequent hash functions may be determined based on the number of data entries that map to each cell of the hash table. The subsequent hash functions may be chosen to minimize collisions of data in the hash table. Remap information for the cells of the hash table may be stored in a reorganizer table. The data may then be rehashed into the hash table using the one or more subsequent hash functions and the stored remap information.

US Patent:

20070005921, Jan 4, 2007

Filed:

Jun 30, 2005

Appl. No.:

11/174072

Inventors:

Afshin Ganjoo - San Jose CA, US
Christopher Conley - West Sacramento CA, US

International Classification:

G06F 13/00
G06F 12/00

US Classification:

711165000, 711103000

Abstract:

A method, device, and system are disclosed. In one embodiment, the method comprises receiving a code segment to be inserted into a flash memory storing code segments, selecting one or more contiguous code segments in flash memory with a total size equal to or larger than the received code segment, calculating the amount of data movement necessary for the one or more selected contiguous code segments, and if the amount is minimum, moving the one or more selected contiguous code segments and replacing them with the received code segment.

US Patent:

20190238477, Aug 1, 2019

Filed:

Apr 10, 2019

Appl. No.:

16/380555

Inventors:

- Palo Alto CA, US
Afshin Ganjoo - San Jose CA, US

International Classification:

H04L 12/917
G06F 16/2455
H04L 12/26
G06F 16/22

Abstract:

The processing of search queries for a customer using a set of resource can balance performance with cost, in order to ensure that the processing satisfies customer performance requirements while attempting to minimize the cost to the customer for obtaining that performance. In addition to dynamically updating the allocation of resources used to process the requests, such as to change the number or sizes of allocated resources, the number of indexes to be searched can be updated as well. For example, a search index can be divided into two sub-indexes against which queries can be executed concurrently in order to reduce the latency by about a half. Adjustments to the indexes and resources can be balanced to minimize cost while retaining performance, which can include rejoining sub-indexes or reducing the number of resource as appropriate.

US Patent:

20180247213, Aug 30, 2018

Filed:

Feb 28, 2017

Appl. No.:

15/444824

Inventors:

- Sunnyvale CA, US
Afshin Ganjoo - San Jose CA, US

International Classification:

G06N 7/00
G06F 17/30
G06F 9/44

Abstract:

Described are methods and systems to identify analyzing a social network to predict member actions, queries, or ranks within a social networking system. According to various embodiments, the system detects changes within a first data set of a first member. The system identifies an entity associated with the change in the first data set, determines an action probability of the entity in response to the change, and identifies a second data set associated with a second member having at least one common element with the first data set. The system identifies a set of elements in the first data set and an entity data set corresponding to the change and generates a customized user interface screen comprising a representation of the entity and a portion of the set of elements.

US Patent:

20180247214, Aug 30, 2018

Filed:

Feb 28, 2017

Appl. No.:

15/444856

Inventors:

- Sunnyvale CA, US
Afshin Ganjoo - San Jose CA, US

International Classification:

G06N 7/00
G06F 17/30
H04L 12/26

Abstract:

Described are methods and systems to identify missing connections, facilitate establishing new connections, and identify new nodes within a progression path for entities. According to various embodiments, the system accesses a set of data clusters representing distinct entities, and identifies a progression path for a first entity where the progression path includes a set of nodes. The system determines a match between a subject entity and the first entity based on a current node of a progression path of the subject entity being associated with a selected node of the progression path of the first entity. The system determines that a subsequent node of the progression path of the first entity corresponds to a potential node of the progression path of the subject entity and generates a portion of a message from the subject entity to the first entity.