CACHE MAP WITH SEQUENTIAL TRACKING FOR INVALIDATION

    公开(公告)号:US20190332546A1

    公开(公告)日:2019-10-31

    申请号:US16506102

    申请日:2019-07-09

    Inventor: Sata Busayarat

    Abstract: The described technology is directed towards efficiently invalidating cached data (e.g., expired data) in a hash-mapped cache, e.g., on a timed basis. As a result, data is able returned from the cache without checking for whether that data is expired, (if desired and acceptable), because if expired, the data is only briefly expired since the last invalidation run. To this end, a data structure such as a linked list is maintained to track information representative of hash-mapped cache locations of a hash-mapped cache, in which the information tracks a sequential order of entering data into each hash-mapped cache location. An invalidation run is performed on part of the hash mapped cache, including using the tracking information to invalidate a sequence of one or more cache locations, e.g., only the sequence of those locations that contain expired data.

    DATA REQUEST MULTIPLEXING
    23.
    发明申请

    公开(公告)号:US20180343320A1

    公开(公告)日:2018-11-29

    申请号:US16054278

    申请日:2018-08-03

    Abstract: The described technology is generally directed towards combining (multiplexing) two or more pending data requests for the same data item into a single request that is sent to a data providing entity such as a back-end data service. Described is maintaining a mapping of the requests to requesting entities so that a single response to a multiplexed request having data for a requested data item may be re-associated (de-multiplexed) to each requesting entity that requested that data item. Also described is batching a plurality of requests, which may include one or more multiplexed requests, into a batch request sent to a data providing entity.

    VIRTUAL GRAPH NODES
    24.
    发明申请
    VIRTUAL GRAPH NODES 审中-公开

    公开(公告)号:US20180321984A1

    公开(公告)日:2018-11-08

    申请号:US15584142

    申请日:2017-05-02

    Abstract: The described technology is directed towards returning less data than is available for a data item in response to a request to a data service. A virtual graph node is returned in response to client requests, in which the virtual node comprises a relatively lightweight set of information relative to the full set of information for the data item, e.g., maintained in a main (graph) node. A requesting client indicates that a virtual node is desired, and receives a response comprising the virtual node, generally processed from the main node's data into a reduced subset of the main node. The main node may be cached at the data service, and returned if and when requested.

    CACHE MAP WITH SEQUENTIAL TRACKING FOR INVALIDATION

    公开(公告)号:US20170277638A1

    公开(公告)日:2017-09-28

    申请号:US15081812

    申请日:2016-03-25

    Inventor: Sata Busayarat

    Abstract: The described technology is directed towards efficiently invalidating cached data (e.g., expired data) in a hash-mapped cache, e.g., on a timed basis. As a result, data is able returned from the cache without checking for whether that data is expired, (if desired and acceptable), because if expired, the data is only briefly expired since the last invalidation run. To this end, a data structure such as a linked list is maintained to track information representative of hash-mapped cache locations of a hash-mapped cache, in which the information tracks a sequential order of entering data into each hash-mapped cache location. An invalidation run is performed on part of the hash mapped cache, including using the tracking information to invalidate a sequence of one or more cache locations, e.g., only the sequence of those locations that contain expired data.

    TIME OFFSET DATA REQUEST HANDLING
    27.
    发明申请

    公开(公告)号:US20210329318A1

    公开(公告)日:2021-10-21

    申请号:US17363075

    申请日:2021-06-30

    Abstract: The described technology is directed towards obtaining and returning time offset data instead of current data in response to a data request. The time offset data may be limited to privileged clients only, and only provided thereto when desired, using a time offset value set by the client, for example. For example, a privileged user may request time offset data corresponding to a future time so as to preview how the data may be presented at a future time. Time offset data may be used by a system entity to fill a cache, e.g., as secondary cached data that may be used once primary cached data expires.

    Time offset data request handling
    28.
    发明授权

    公开(公告)号:US11082735B2

    公开(公告)日:2021-08-03

    申请号:US16574627

    申请日:2019-09-18

    Abstract: The described technology is directed towards obtaining and returning time offset data instead of current data in response to a data request. The time offset data may be limited to privileged clients only, and only provided thereto when desired, using a time offset value set by the client, for example. For example, a privileged user may request time offset data corresponding to a future time so as to preview how the data may be presented at a future time. Time offset data may be used by a system entity to fill a cache, e.g., as secondary cached data that may be used once primary cached data expires.

    TEMPLATING DATA SERVICE RESPONSES
    29.
    发明申请

    公开(公告)号:US20200296184A1

    公开(公告)日:2020-09-17

    申请号:US16889149

    申请日:2020-06-01

    Abstract: The described technology is directed towards locating and using a template for processing data item data from a general form into a client-specific form for returning in response to a client request. A client request includes a data item identifier and client-specific information. The data item's identifier is processed into a data type and/or identifier, e.g., a string. The client-specific information is used to determine a device class, device type and/or client platform software version. The template is found in a hierarchy of templates based upon the client-specific information and the data type or data ID string, e.g., the client-specific information may be used to determine a subset of template folders that is evaluated to find a file with a filename matching the string. The folders may be ordered from most-specific to least-specific, so as to locate the most specific template file that applies.

Patent Agency Ranking