# US 2021/0279216 A1 · Systems and methods for efficiently maintaining records in a cloud-based system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0279216 A1
- Document ID: US20210279216A1
- Status: Published application
- Kind: A1
- Application number: 16/851,161
- Filed: 2020-04-17
- Published: 2021-09-09
- Earliest claimed: 2020-03-05
- Assignees: Zscaler, Inc.
- Applicants: Zscaler, Inc.
- Inventors: Raman Madaan; Kumar Gaurav; Chakkaravarthy Periyasamy Balaiah; Kailash Kailash
- Web page: https://patentgrep.com/patent/US20210279216A1

## CPC

- G06F 16/1744: {using compression, e.g. sparse files}
- G06F 16/217: {Database tuning (G06F16/2282 takes precedence; database performance monitoring G06F11/3409)}
- G06F 16/2462: {Approximate or statistical queries}
- G06N 20/00: Machine learning
- G06Q 50/265: {Personal security, identity or safety}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

Systems and methods include obtaining statistics based on monitoring in a cloud-based system for a given time period; and, responsive to determining an arrangement of counters for N counters, storing each of M counters for the given time period as a plurality of records with each record including a record type, a possible offset to a next record in terms of a counter identifier (ID), and a counter value, wherein N and M are integers and M<<N, and wherein the arrangement is determined such that most frequently used counters occupy lower counter IDs. The systems and methods can further include updating the arrangement of the counters for the N counters, to perform an optimization such that the most frequently used counters occupy lower counter IDs.

## Claims

### Claim 1

A non-transitory computer-readable storage medium having computer-readable code stored thereon for programming a processor to perform steps of:
obtaining statistics based on monitoring in a cloud-based system for a given time period; and
responsive to determining an arrangement of counters for N counters, storing each of M counters for the given time period as a plurality of records with each record including a record type, a possible offset to a next record in terms of a counter identifier (ID), and a counter value, wherein N and M are integers and M<<N, and wherein the arrangement is determined such that most frequently used counters occupy lower counter IDs.

### Claim 2 (depends on 1)

The non-transitory computer-readable storage medium of claim 1, further comprising
updating the arrangement of the counters for the N counters, to perform an optimization such that the most frequently used counters occupy lower counter IDs.

### Claim 3 (depends on 2)

The non-transitory computer-readable storage medium of claim 2, wherein the updating is based on historical data and machine learning.

### Claim 4 (depends on 1)

The non-transitory computer-readable storage medium of claim 1, wherein the arrangement is further determined such that counters in the N counters frequently used together are subsequent to one another.

### Claim 5 (depends on 1)

The non-transitory computer-readable storage medium of claim 1, wherein the possible offset is omitted when a record has a counter ID subsequent to a previous record's counter ID.

### Claim 6 (depends on 1)

The non-transitory computer-readable storage medium of claim 1, wherein the record type is a fixed value that determines a size and range of the possible offset and a value or value range of the counter value.

### Claim 7 (depends on 1)

The non-transitory computer-readable storage medium of claim 1, wherein the possible offset is one of 1 or a value specified in bits of a record, based on the record type.

### Claim 8 (depends on 1)

The non-transitory computer-readable storage medium of claim 1, wherein N is on an order of tens of thousands and M is several orders of magnitude less than N.

### Claim 9

A server comprising:
a network interface communicatively coupled to a network;
a processor communicatively coupled to the network interface; and
memory storing computer-executable instructions that, when executed, cause the processor to
obtain statistics based on monitoring in a cloud-based system for a given time period; and
responsive to a determination of an arrangement of counters for N counters, store each of M counters for the given time period as a plurality of records with each record including a record type, a possible offset to a next record in terms of a counter identifier (ID), and a counter value, wherein N and M are integers and M<<N, and wherein the arrangement is determined such that most frequently used counters occupy lower counter IDs.

### Claim 10 (depends on 9)

The server of claim 9, wherein the computer-executable instructions that, when executed, further cause the processor to
update the arrangement of the counters for the N counters, to perform an optimization such that the most frequently used counters occupy lower counter IDs.

### Claim 11 (depends on 10)

The server of claim 10, wherein the updating is based on historical data and machine learning.

### Claim 12 (depends on 9)

The server of claim 9, wherein the arrangement is further determined such that counters in the N counters frequently used together are subsequent to one another.

### Claim 13 (depends on 9)

The server of claim 9, wherein the possible offset is omitted when a record has a counter ID subsequent to a previous record's counter ID.

### Claim 14 (depends on 9)

The server of claim 9, wherein the record type is a fixed value that determines a size and range of the possible offset and a value or value range of the counter value.

### Claim 15 (depends on 9)

The server of claim 9, wherein the possible offset is one of 1 or a value specified in bits of a record, based on the record type.

### Claim 16

A method comprising:
obtaining statistics based on monitoring in a cloud-based system for a given time period; and
responsive to determining an arrangement of counters for N counters, storing each of M counters for the given time period as a plurality of records with each record including a record type, a possible offset to a next record in terms of a counter identifier (ID), and a counter value, wherein N and M are integers and M<<N, and wherein the arrangement is determined such that most frequently used counters occupy lower counter IDs.

### Claim 17 (depends on 16)

The method of claim 16, further comprising
updating the arrangement of the counters for the N counters, to perform an optimization such that the most frequently used counters occupy lower counter IDs.

### Claim 18 (depends on 16)

The method of claim 16, wherein the arrangement is further determined such that counters in the N counters frequently used together are subsequent to one another.

### Claim 19 (depends on 16)

The method of claim 16, wherein the possible offset is omitted when a record has a counter ID subsequent to a previous record's counter ID.

### Claim 20 (depends on 16)

The method of claim 16, wherein the record type is a fixed value that determines a size and range of the possible offset and a value or value range of the counter value, and
wherein the possible offset is one of 1 or a value specified in bits of a record, based on the record type.