Rasik H Phalak

US Patent:

20180349823, Dec 6, 2018

Filed:

Jun 6, 2017

Appl. No.:

15/615021

Inventors:

- San Francisco CA, US
Nilesh Patel - San Rafael CA, US
Priyank Shah - Fremont CA, US
Rasik Phalak - Fremont CA, US

Assignee:

salesforce.com, inc. - San Francisco CA

International Classification:

G06Q 10/06
G06Q 30/00

Abstract:

Systems and methods are disclosed for scheduling a service appointment. A method can include analyzing attributes of a customer service request with respect to a problem area. A multi-factor scheduling analysis is performed by analyzing skill level and resource data associated with the problem area attributes for servicing the customer service request. The analysis is used for scheduling a service appointment to handle the customer service request.

US Patent:

20180307709, Oct 25, 2018

Filed:

Apr 25, 2017

Appl. No.:

15/496894

Inventors:

- San Francisco CA, US
Roojuta LALANI - Fremont CA, US
Rasik PHALAK - Fremont CA, US

International Classification:

G06F 17/30

Abstract:

A method and system for generating a hierarchical data structure is described. The hierarchical data structure is comprised of a plurality of nodes, wherein each node represents a record. The system monitors the generation of the hierarchical data structure to determine if the number of nodes in the hierarchical data structure exceeds a predetermined maximum number of nodes for the hierarchical data structure. The maximum number of nodes is independent of a width and a height of the hierarchical data structure. The system generates a notification in response to a determination that the number of nodes in the hierarchical data structure exceeds the maximum number of nodes.

US Patent:

20180307737, Oct 25, 2018

Filed:

Apr 25, 2017

Appl. No.:

15/496983

Inventors:

- San Francisco CA, US
Roojuta LALANI - Fremont CA, US
Rasik PHALAK - Fremont CA, US

International Classification:

G06F 17/30

Abstract:

A method and system for updating nodes in a hierarchical data structure is described. The system receives an update to a first node representing a record in a hierarchical data structure. The system determines at least one other node that needs updating based on the update to the first node. The system compares the number of nodes that need updating based upon the update to the first node to a maximum number to determine whether the number of nodes that need updating is less than, equal to and greater than the maximum number. The system performs a synchronous update of the nodes that need updating in response to a determination that the number of nodes is less than or equal to the maximum number and an asynchronous update of the nodes that need updating in response to a determination that the number of nodes is greater than the maximum number.