# US 2025/0147661 A1 · Code point skipping with variable-width encoding for data analytics system

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

- Number: US 2025/0147661 A1
- Document ID: US20250147661A1
- Status: Published application
- Kind: A1
- Application number: 18/501,821
- Filed: 2023-11-03
- Published: 2025-05-08
- Earliest claimed: 2023-11-03
- Assignees: Alteryx, Inc.
- Applicants: Alteryx, Inc.
- Inventors: Christopher H. Kingsley
- Web page: https://patentgrep.com/patent/US20250147661A1

## CPC

- G06F 3/0608: {Saving storage space on storage systems}
- G06F 3/0655: {Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices}
- G06F 3/0673: {Single storage device}
- G06F 16/148: {File search processing}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A computer system performs a code point skipping method for skipping a desired number of code points. The computer system accesses a data file stored in memory of a computing device. The data file may include a series of characters corresponding to a series of code points. The code points of the data file may be encoded in memory using a variable-width encoding scheme, and a code point corresponds to one or more encoded bytes in memory. The computer system creates a pointer pointing to a location in the memory for the data file. The computer system receives a request to skip ahead a particular number of code points in the data file to a desired location. The computer system determines a number of lead bytes in a multi-byte sequence to determine a number of code points to skip and repeats this process for the next multi-byte sequence.

## Claims

### Claim at position 1

1-22. (canceled)

### Claim 23

A method, comprising:
accessing a data file stored in memory of a computing device, the data file including a series of characters corresponding to a series of code points, each code point in the series of code points being encoded in memory using a variable-width encoding scheme, and each code point in the series of code points corresponding to one or more encoded bytes in memory;
receiving a request to skip ahead a desired number of code points in the data file from a reference code point in the series of code points;
initializing a counter indicating the desired number of code points to be skipped;
initializing a pointer, the pointer pointing to a location in the memory corresponding to the reference code point;
performing, for each iteration in one or more iterations, until the counter satisfies a threshold value:
loading a multi-byte chunk of data in the memory, starting from the location of the pointer, into at least one register;
determining a number of lead bytes in the multi-byte chunk by performing one or more operations on the multi-byte chunk; and
decrementing the counter using the number of lead bytes and advancing the pointer to a different location in the memory based on a number of bytes in the multi-byte chunk;
responsive to the counter satisfying the threshold value, individually processing at least one code point in the series of code points to advance the pointer until the counter satisfies a minimum value; and
responsive to the counter satisfying the minimum value, outputting data corresponding to a destination code point in the series of code points, the destination code point being identified by a current position of the pointer.

### Claim 24 (depends on 23)

The method of claim 23, wherein determining the number of lead bytes in the multi-byte chunk comprises:
generating a complemented shifted chunk by performing a right shift operation to the multi-byte chunk;
performing an OR operation using the multi-byte chunk and the complemented shifted chunk;
generating an output sequence by performing an AND operation using a result of the OR operation and a comparison sequence; and
counting a number of 1-bits in the output sequence and setting the number of 1-bits as the number of lead bytes for the multi-byte chunk.

### Claim 25 (depends on 24)

The method of claim 24, wherein the comparison sequence is a repeated sequence of 0x40.

### Claim 26 (depends on 23)

The method of claim 23, wherein processing the at least one code point in the series of code points comprises:
identifying a byte based on a location of the pointer;
loading the byte into the at least one register;
in response to determining that the byte is a lead byte, determining a number of trailing bytes following the byte; and
moving the pointer based on the number of trailing bytes.

### Claim 27 (depends on 23)

The method of claim 23, further comprising determining whether the multi-byte chunk includes a NULL byte before determining the number of lead bytes in the multi-byte chunk.

### Claim 28 (depends on 27)

The method of claim 27, wherein determining whether the multi-byte chunk includes a NULL byte comprises:
generating a first shifted sequence by performing a right shift operation of one bit to the multi-byte chunk;
generating a first resulting chunk by performing an OR operation using the multi-byte chunk and the first shifted sequence;
designating the first resulting chunk as the multi-byte chunk;
generating a second shifted chunk by performing a right shift operation of two bits to the multi-byte chunk;
generating a second resulting chunk by performing an OR operation using the multi-byte chunk and the second shifted chunk;
designating the second resulting chunk as the multi-byte chunk;
generating a third shifted chunk by performing a right shift operation of four bits to the multi-byte chunk;
generating a third resulting chunk by performing an OR operation using the multi-byte chunk and the third shifted chunk;
designating the third resulting chunk as the multi-byte chunk;
performing an AND operation using the multi-byte chunk and a comparison sequence;
determining that a NULL byte is included in the multi-byte chunk based on the AND operation; and
providing an indication to the computing device indicating an error in the data file.

### Claim 29 (depends on 23)

The method of claim 23, wherein the variable-width encoding scheme is UTF-8 and the at least one register comprises at least one of a 32-bit register, a 64-bit register, or a 128-bit register.

### Claim 30 (depends on 23)

The method of claim 23, further comprising:
determining that a memory address of the reference code point is not aligned;
responsive to determining that the memory address of the reference code point is not aligned, identifying a number of bytes in the data file until a next chunk of the data file is memory aligned;
loading an initial chunk of memory including one or more padded bytes and the number of bytes to a register; and
moving the pointer to a location in memory that corresponds to the next chunk.

### Claim 31

A non-transitory computer-readable medium storing instructions that are executable by at least one processing device to perform operations comprising:
accessing a data file stored in memory of a computing device, the data file including a series of characters corresponding to a series of code points, each code point in the series of code points being encoded in memory using a variable-width encoding scheme, and each code point in the series of code points corresponding to one or more encoded bytes in memory;
receiving a request to skip ahead a desired number of code points in the data file from a reference code point in the series of code points;
initializing a counter indicating the desired number of code points to be skipped;
initializing a pointer, the pointer pointing to a location in the memory corresponding to the reference code point;
performing, for each iteration in one or more iterations, until the counter satisfies a threshold value:
loading a multi-byte chunk of data in the memory, starting from the location of the pointer, into at least one register;
determining a number of lead bytes in the multi-byte chunk by performing one or more operations on the multi-byte chunk; and
decrementing the counter using the number of lead bytes and advancing the pointer to a different location in the memory based on a number of bytes in the multi-byte chunk;
responsive to the counter satisfying the threshold value, individually processing at least one code point in the series of code points to advance the pointer until the counter satisfies a minimum value; and
responsive to the counter satisfying the minimum value, outputting data corresponding to a destination code point in the series of code points, the destination code point being identified by a current position of the pointer.

### Claim 32 (depends on 31)

The non-transitory computer-readable medium of claim 31, wherein determining the number of lead bytes in the multi-byte chunk comprises:
generating a complemented shifted chunk by performing a right shift operation to the multi-byte chunk;
performing an OR operation using the multi-byte chunk and the complemented shifted chunk;
generating an output sequence by performing an AND operation using a result of the OR operation and a comparison sequence; and
counting a number of 1-bits in the output sequence and setting the number of 1-bits as the number of lead bytes for the multi-byte chunk.

### Claim 33 (depends on 32)

The non-transitory computer-readable medium of claim 32, wherein the comparison sequence is a repeated sequence of 0x40.

### Claim 34 (depends on 31)

The non-transitory computer-readable medium of claim 31, wherein processing the at least one code point in the series of code points comprises:
identifying a byte based on a location of the pointer;
loading the byte into the at least one register;
in response to determining that the byte is a lead byte, determining a number of trailing bytes following the byte; and
moving the pointer based on the number of trailing bytes.

### Claim 35 (depends on 31)

The non-transitory computer-readable medium of claim 31, the operations further comprising determining whether the multi-byte chunk includes a NULL byte before determining the number of lead bytes in the multi-byte chunk.

### Claim 36 (depends on 35)

The non-transitory computer-readable medium of claim 35, wherein determining whether the multi-byte chunk includes a NULL byte comprises:
generating a first shifted sequence by performing a right shift operation of one bit to the multi-byte chunk;
generating a first resulting chunk by performing an OR operation using the multi-byte chunk and the first shifted sequence;
designating the first resulting chunk as the multi-byte chunk;
generating a second shifted chunk by performing a right shift operation of two bits to the multi-byte chunk;
generating a second resulting chunk by performing an OR operation using the multi-byte chunk and the second shifted chunk;
designating the second resulting chunk as the multi-byte chunk;
generating a third shifted chunk by performing a right shift operation of four bits to the multi-byte chunk;
generating a third resulting chunk by performing an OR operation using the multi-byte chunk and the third shifted chunk;
designating the third resulting chunk as the multi-byte chunk;
performing an AND operation using the multi-byte chunk and a comparison sequence;
determining that a NULL byte is included in the multi-byte chunk based on the AND operation; and
providing an indication to the computing device indicating an error in the data file.

### Claim 37 (depends on 31)

The non-transitory computer-readable medium of claim 31, wherein the variable-width encoding scheme is UTF-8 and the at least one register comprises at least one of a 32-bit register, a 64-bit register, or a 128-bit register.

### Claim 38 (depends on 31)

The non-transitory computer-readable medium of claim 31, the operations further comprising:
determining that a memory address of the reference code point is not aligned;
responsive to determining that the memory address of the reference code point is not aligned, identifying a number of bytes in the data file until a next chunk of the data file is memory aligned;
loading an initial chunk of memory including one or more padded bytes and the number of bytes to a register; and
moving the pointer to a location in memory that corresponds to the next chunk.

### Claim 39

A system comprising:
one or more processors; and
a computer-readable storage medium storing instructions that are executable by the one or more processors to perform operations comprising:
accessing a data file stored in memory of a computing device, the data file including a series of characters corresponding to a series of code points, each code point in the series of code points being encoded in memory using a variable-width encoding scheme, and each code point in the series of code points corresponding to one or more encoded bytes in memory;
receiving a request to skip ahead a desired number of code points in the data file from a reference code point in the series of code points;
initializing a counter indicating the desired number of code points to be skipped;
initializing a pointer, the pointer pointing to a location in the memory corresponding to the reference code point;
performing, for each iteration in one or more iterations, until the counter satisfies a threshold value:
loading a multi-byte chunk of data in the memory, starting from the location of the pointer, into at least one register;
determining a number of lead bytes in the multi-byte chunk by performing one or more operations on the multi-byte chunk; and
decrementing the counter using the number of lead bytes and advancing the pointer to a different location in the memory based on a number of bytes in the multi-byte chunk;
responsive to the counter satisfying the threshold value, individually processing at least one code point in the series of code points to advance the pointer until the counter satisfies a minimum value; and
responsive to the counter satisfying the minimum value, outputting data corresponding to a destination code point in the series of code points, the destination code point being identified by a current position of the pointer.

### Claim 40 (depends on 39)

The system of claim 39, wherein determining the number of lead bytes in the multi-byte chunk comprises:
generating a complemented shifted chunk by performing a right shift operation to the multi-byte chunk;
performing an OR operation using the multi-byte chunk and the complemented shifted chunk;
generating an output sequence by performing an AND operation using a result of the OR operation and a comparison sequence; and
counting a number of 1-bits in the output sequence and setting the number of 1-bits as the number of lead bytes for the multi-byte chunk.

### Claim 41 (depends on 39)

The system of claim 39, wherein processing the at least one code point in the series of code points comprises:
identifying a byte based on a location of the pointer;
loading the byte into the at least one register;
in response to determining that the byte is a lead byte, determining a number of trailing bytes following the byte; and
moving the pointer based on the number of trailing bytes.

### Claim 42 (depends on 39)

The system of claim 39, the operations further comprising determining whether the multi-byte chunk includes a NULL byte before determining the number of lead bytes in the multi-byte chunk by:
generating a first shifted sequence by performing a right shift operation of one bit to the multi-byte chunk;
generating a first resulting chunk by performing an OR operation using the multi-byte chunk and the first shifted sequence;
designating the first resulting chunk as the multi-byte chunk;
generating a second shifted chunk by performing a right shift operation of two bits to the multi-byte chunk;
generating a second resulting chunk by performing an OR operation using the multi-byte chunk and the second shifted chunk;
designating the second resulting chunk as the multi-byte chunk;
generating a third shifted chunk by performing a right shift operation of four bits to the multi-byte chunk;
generating a third resulting chunk by performing an OR operation using the multi-byte chunk and the third shifted chunk;
designating the third resulting chunk as the multi-byte chunk;
performing an AND operation using the multi-byte chunk and a comparison sequence;
determining that a NULL byte is included in the multi-byte chunk based on the AND operation; and
providing an indication to the computing device indicating an error in the data file.
