US 11,893,023 B2
Deterministic searching using compressed indexes
John Colgrove, Los Altos, CA (US); and Ethan L. Miller, Santa Cruz, CA (US)
Assigned to PURE STORAGE, INC., Santa Clara, CA (US)
Filed by Pure Storage, Inc., Mountain View, CA (US)
Filed on Apr. 22, 2022, as Appl. No. 17/727,339.
Application 17/727,339 is a continuation of application No. 16/744,019, filed on Jan. 15, 2020.
Application 16/744,019 is a continuation in part of application No. 16/206,595, filed on Nov. 30, 2018, granted, now 11,249,999, issued on Feb. 15, 2022.
Application 16/206,595 is a continuation of application No. 14/846,566, filed on Sep. 4, 2015, abandoned.
Prior Publication US 2022/0253439 A1, Aug. 11, 2022
Int. Cl. G06F 16/2455 (2019.01); G06F 16/22 (2019.01)
CPC G06F 16/2455 (2019.01) [G06F 16/2255 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A method, comprising:
providing a first table in a memory for determining whether there is an entry for a value in a second table, the first table comprising a plurality of buckets pointed to by address fields of values, each bucket having a prefix table and a signature table that are derived from corresponding values; and
splitting a first bucket in the first table into a second bucket and a third bucket, the first bucket having a first prefix table and a first signature table, the second bucket and the third bucket pointed to by an address field pointing to the first bucket plus an extra bit, wherein the first bucket is identified as being split based on a table that tracks bucket splits.