公开(公告)号：US20140201247A1

公开(公告)日：2014-07-17

申请号：US13972501

申请日：2013-08-21

Applicant: Google Inc.

Inventor： Ulas Kirazci ,  Justin Foutts

IPC: G06F17/30

CPC classification number: G06F17/30961 ,  G06F17/30292 ,  G06F17/30625

Abstract: A data structure includes three arrays. A first array includes a root node, one or more intermediate nodes, and one or more leaf nodes. A second array includes one or more slices, each of which includes one or more elements; a third array also includes one or more elements. Each root node and intermediate node in the first array points to a respective slice in the second array. Each element in the second array stores a byte and has an associated pointer that points either to a respective intermediate node or to a respective leaf node in the first array. Each leaf node in the first array points to a respective element in the third array, and each element in the third array stores a respective sub-string of bytes. The trie can be particularly advantageous, for example, in applications on resource-constrained computing devices, such as mobile phones, tablets, and other hand-held computing devices.

Abstract translation: 数据结构包括三个数组。 第一阵列包括根节点，一个或多个中间节点和一个或多个叶节点。 第二阵列包括一个或多个切片，每个切片包括一个或多个元件; 第三阵列还包括一个或多个元件。 第一阵列中的每个根节点和中间节点指向第二阵列中的相应切片。 第二阵列中的每个元素存储一个字节，并且具有指向相应的中间节点或第一阵列中相应的叶节点的相关联的指针。 第一阵列中的每个叶节点指向第三阵列中的相应元素，并且第三阵列中的每个元素存储相应的字节子串。 例如，在诸如移动电话，平板电脑和其他手持计算设备的资源受限的计算设备上的应用中，特里是特别有利的。

公开(公告)号：US09378304B2

公开(公告)日：2016-06-28

申请号：US13972501

申请日：2013-08-21

Applicant: Google Inc.

Inventor： Ulas Kirazci ,  Justin Foutts

IPC: G06F17/30

CPC classification number: G06F17/30961 ,  G06F17/30292 ,  G06F17/30625

Abstract: A data structure includes three arrays. A first array includes a root node, one or more intermediate nodes, and one or more leaf nodes. A second array includes one or more slices, each of which includes one or more elements; a third array also includes one or more elements. Each root node and intermediate node in the first array points to a respective slice in the second array. Each element in the second array stores a byte and has an associated pointer that points either to a respective intermediate node or to a respective leaf node in the first array. Each leaf node in the first array points to a respective element in the third array, and each element in the third array stores a respective sub-string of bytes. The trie can be particularly advantageous, for example, in applications on resource-constrained computing devices, such as mobile phones, tablets, and other hand-held computing devices.

Abstract translation: 数据结构包括三个数组。 第一阵列包括根节点，一个或多个中间节点和一个或多个叶节点。 第二阵列包括一个或多个切片，每个切片包括一个或多个元件; 第三阵列还包括一个或多个元件。 第一阵列中的每个根节点和中间节点指向第二阵列中的相应切片。 第二阵列中的每个元素存储一个字节，并且具有指向相应的中间节点或第一阵列中相应的叶节点的相关联的指针。 第一阵列中的每个叶节点指向第三阵列中的相应元素，并且第三阵列中的每个元素存储相应的字节子串。 例如，在诸如移动电话，平板电脑和其他手持计算设备的资源受限的计算设备上的应用中，特里是特别有利的。

公开(公告)号：US09355113B2

公开(公告)日：2016-05-31

申请号：US14013502

申请日：2013-08-29

Applicant: Google Inc.

Inventor： Ulas Kirazci ,  Justin Foutts

IPC: G06F17/30

CPC classification number: G06F17/30153

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for encoding and decoding delta values. In one aspect, a method includes accessing a compression buffer having a start position, a sentinel position, and a data storage region; obtaining a first value; determining that a second value stored in the sentinel position does not match a first sentinel value; determining that a third value stored in the start position matches a second sentinel value; and storing the first value at the start position of the compression buffer.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于对delta值进行编码和解码。 一方面，一种方法包括访问具有开始位置，前哨位置和数据存储区域的压缩缓冲器; 获得第一个值; 确定存储在所述哨兵位置的第二值与第一哨兵值不匹配; 确定存储在所述起始位置的第三值与第二标记值相匹配; 以及将所述第一值存储在所述压缩缓冲器的开始位置。

公开(公告)号：US20140201174A1

公开(公告)日：2014-07-17

申请号：US14013502

申请日：2013-08-29

Applicant: Google Inc.

Inventor： Ulas Kirazci ,  Justin Foutts

IPC: G06F17/30

CPC classification number: G06F17/30153

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for encoding and decoding delta values. In one aspect, a method includes accessing a compression buffer having a start position, a sentinel position, and a data storage region; obtaining a first value; determining that a second value stored in the sentinel position does not match a first sentinel value; determining that a third value stored in the start position matches a second sentinel value; and storing the first value at the start position of the compression buffer.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于对delta值进行编码和解码。 一方面，一种方法包括访问具有开始位置，前哨位置和数据存储区域的压缩缓冲器; 获得第一个值; 确定存储在所述哨兵位置的第二值与第一哨兵值不匹配; 确定存储在所述起始位置的第三值与第二标记值相匹配; 以及将所述第一值存储在所述压缩缓冲器的开始位置。