Generating probabilistic data structures for lookup tables in computer memory for multi-token searching
AssigneeOneTrust, LLC
InventorsSubramanian Viswanathan, Anand Balasubramanian, Milap Shah, Tianchen Cai
Life of this patent
Estimating the term…
Loading patent…
AssigneeOneTrust, LLC
InventorsSubramanian Viswanathan, Anand Balasubramanian, Milap Shah, Tianchen Cai
Estimating the term…
Methods, systems, and non-transitory computer readable storage media are disclosed for optimizing computer memory usage for lookup lists in computer memory via probabilistic data structures. For example, the disclosed system generates a probabilistic data structure (e.g., a Bloom filter) to represent data in a lookup list including multi-token items by hashing items of the lookup list to sets of bit values in a bit vector. The disclosed system classifies text content in a digital document by utilizing a maximum number of tokens from multi-token items in the lookup list to select and compare sets of sequential tokens in the digital document to the probabilistic data structure. The disclosed system also iteratively reduces the number of tokens in sets of sequential tokens for subsequent comparisons. Furthermore, in some aspects, the disclosed system causes a computing device to modify a digital document and/or database operations based on the classifications.
A computer-implemented method comprising:
A system comprising:
A non-transitory computer readable medium comprising instructions that, when executed by processing hardware, cause the processing hardware to perform operations comprising:
Dependencies are inferred from the claim text.