US 11,700,316 B2
Adaptive compression of stored data
Fateen Sharaby, Fort Lee, NJ (US); Sriram A. Raju Datla, Naperville, IL (US); Dhiraj Subhash Bawadhankar, Naperville, IL (US); John Charles Redfield, Brooklyn, NY (US); and Justin Yeong-Juin Lee, Chicago, IL (US)
Assigned to Chicago Mercantile Exchange Inc., Chicago, IL (US)
Filed by Chicago Mercantile Exchange Inc., Chicago, IL (US)
Filed on Nov. 21, 2022, as Appl. No. 17/991,030.
Application 17/991,030 is a continuation of application No. 17/845,052, filed on Jun. 21, 2022, granted, now 11,539,811.
Application 17/845,052 is a continuation of application No. 17/536,886, filed on Nov. 29, 2021, granted, now 11,399,083, issued on Jul. 26, 2022.
Application 17/536,886 is a continuation of application No. 17/207,881, filed on Mar. 22, 2021, granted, now 11,218,560, issued on Jan. 4, 2022.
Application 17/207,881 is a continuation of application No. 16/792,973, filed on Feb. 18, 2020, granted, now 10,992,766, issued on Apr. 27, 2021.
Application 16/792,973 is a continuation of application No. 15/832,244, filed on Dec. 5, 2017, granted, now 10,609,172, issued on Mar. 31, 2020.
Claims priority of provisional application 62/491,040, filed on Apr. 27, 2017.
Prior Publication US 2023/0084596 A1, Mar. 16, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. H04L 67/5651 (2022.01); H04L 69/04 (2022.01); H03M 7/30 (2006.01); G06F 3/06 (2006.01); H04L 43/16 (2022.01); G06F 16/22 (2019.01)
CPC H04L 67/5651 (2022.05) [G06F 3/061 (2013.01); G06F 3/0608 (2013.01); G06F 16/22 (2019.01); H03M 7/30 (2013.01); H04L 43/16 (2013.01); H04L 69/04 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A system comprising:
a processor and a memory coupled therewith, the memory storing instructions that when executed by the processor cause the processor to:
determine when a data size of any of a plurality of data structures, each storing a plurality of data elements, approaches a threshold, each of the plurality of data elements including data indicative of first and second parameters resulting from an electronic transaction, the plurality of data elements characterized by a third parameter, and based thereon for each data structure whose size exceeds the threshold:
generate a replacement data structure including:
a first replacement data element generated based on a difference between a selected first parameter from among the plurality of data elements and a fourth parameter characterizing the plurality of data elements based on a modification of the first parameter of each of the plurality of data elements as a function of the second parameter thereof; and
when there is a difference between the selected first parameter and the first replacement data element, a second replacement data element generated based on the difference such that the first and second replacement data elements are collectively characterized by a fifth parameter having a same value as the third parameter; and
replace the data structure whose size exceeds the threshold with the replacement data structure, the data structure size thereby being reduced.