IP Library Granted Patent US 12,744,834
Granted Patent B2
US 12,744,834 · App. 18/944,929 · Granted Sep 22, 2026

Adaptive compression of stored data

Inventors: Fateen Sharaby (Fort Lee, NJ); Sriram A. Raju Datla (Naperville, IL); Dhiraj Subhash Bawadhankar (Naperville, IL); John Charles Redfield (Brooklyn, NY); Justin Yeong-Juin Lee (Chicago, IL)
Assignee: Chicago Mercantile Exchange Inc.
H04L67/5651G06F3/0608G06F3/061G06F16/22H03M7/30H04L43/16H04L69/04
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,744,834
App. No.
18/944,929
Granted
Sep 22, 2026
Kind
B2
Abstract

Systems, devices and methods for adaptive compression of stored information includes a memory management computing device programmed to monitor a size of a plurality of data structures stored in a data repository. The computing device compares the size of each of a plurality of data structures to a predetermined threshold. When a size of an uncompressed data structure meets the threshold, the memory management computing device calculates a value of a first compression parameter based on a value of a first parameter and a value of a second parameter of each data element of the uncompressed data structure, calculates a value of a second compression parameter based the value of the first parameter of each data element of the uncompressed data structure, generates a compressed data structure based on the value of the first compression parameter and the second compression parameter; and replaces, in the data repository, the uncompressed data structure with the compressed data structure.

Claims (25)

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 that data storage required to store data items, each having first and second data values resulting from an electronic transaction, exceeds a threshold, the data items being collectively characterized based on the first and second values of each data item, and automatically, based thereon, reduce the data storage required via replacement of the data items with first and, when generated, second replacement data, the first replacement data being generated based on a difference between a first value of one of the data items and a third value characterizing the data items based on the first value of each of the data items being modified as a function of the second value thereof, and the second replacement data being generated when there is a difference between the first value of the one of the plurality of data and the first replacement data so that the first and second replacement data are collectively characterized identically to the data items.

2 . The system of claim 1 , wherein the data items comprise an electronic record of results of a plurality of electronic transactions corresponding to an associated user completed prior to the determination.

3 . The system of claim 2 , wherein the instructions are further executable by the processor to cause the processor to determine, subsequent to the replacement, that another electronic transaction corresponding to the associated user has been completed and, based thereon, add data indicative thereof to the data items.

4 . The system of claim 2 , wherein each of the data items corresponds to a result of a different electronic transaction and wherein the first value of at least one of the plurality of data is different from the first value of another of the data items.

5 . The system of claim 4 , wherein each electronic transaction comprises an interest rate swap, the collective characteristic comprising a risk value.

6 . The system of claim 1 , wherein the data items are stored remote from the processor.

7 . The system of claim 1 , wherein the first value corresponds to an interest rate and the second value corresponds to a notional value.

8 . The system of claim 1 , wherein the data items are collectively characterized by a collective cash flow of the electronic transactions represented by the data items.

9 . The system of claim 1 , wherein the required data storage may be subject to a limit different from a limit to which the required data storage of other data items are subject.

10 . The system of claim 1 , wherein the data items are periodically synchronized with a remote computer system via a communications network, the first and, when generated, second replacement data taking less time to synchronize than the data items which were replaced.

11 . A computer implemented method comprising:

determining, by a processor, that data storage required to store data items, each having first and second data values resulting from an electronic transaction, exceeds a threshold, the data items being collectively characterized based on the first and second values of each data item, and automatically, based thereon, reducing the data storage required by replacing the data items with first and, when generated, second replacement data, the first replacement data being generated based on a difference between a first value of one of the data items and a third value characterizing the data items based on the first value of each of the data items being modified as a function of the second value thereof, and the second replacement data being generated when there is a difference between the first value of the one of the plurality of data and the first replacement data so that the first and second replacement data are collectively characterized identically to the data items.

12 . The computer implemented method of claim 11 , wherein the data items comprise an electronic record of results of a plurality of electronic transactions corresponding to an associated user completed prior to the determination.

13 . The computer implemented method of claim 12 , further comprising determining, by the processor subsequent to the replacement, that another electronic transaction corresponding to the associated user has been completed and, based thereon, adding data indicative thereof to the data items.

14 . The computer implemented method of claim 12 , wherein each of the data items corresponds to a result of a different electronic transaction and wherein the first value of at least one of the data items is different from the first value of another of the data items.

15 . The computer implemented method of claim 14 , wherein each electronic transaction comprises an interest rate swap, the collective characteristic comprising a risk value.

16 . The computer implemented method of claim 11 , wherein the data items are stored remote from the processor.

17 . The computer implemented method of claim 11 , wherein the first value corresponds to an interest rate and the second value corresponds to a notional value.

18 . The computer implemented method of claim 11 , wherein the data items are collectively characterized by a collective cash flow of the electronic transactions represented by the data items.

19 . The computer implemented method of claim 11 , wherein the required data storage may be subject to a limit different from a limit to which the required data storage of other data items are subject.

20 . The computer implemented method of claim 11 , wherein the data items are periodically synchronized with a remote computer system via a communications network, the first and, when generated, second replacement data taking less time to synchronize than the data items which were replaced.

21 . A memory management computing device comprising:

a processor and a memory coupled therewith, the memory storing instructions that when executed by the processor cause the processor to perform the steps of:

determining that data storage required to store data items, each having first and second data values resulting from an electronic transaction, exceeds a threshold, the data items being collectively characterized based on the first and second values of each data item, and automatically, based thereon, reducing the data storage required by replacing the data items with first and, when generated, second replacement data, the first replacement data being generated based on a difference between a first value of one of the data items and a third value characterizing the data items based on the first value of each of the data items being modified as a function of the second value thereof, and the second replacement data being generated when there is a difference between the first value of the one of the plurality of data and the first replacement data so that the first and second replacement data are collectively characterized identically to the data items.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 12, 2024
From: SHARABY, FATEEN; DATLA, SRIRAM A. RAJU; BAWADHANKAR, DHIRAJ SUBHASH; REDFIELD, JOHN CHARLES; LEE, JUSTIN YEONG-JUIN
To: CHICAGO MERCANTILE EXCHANGE INC.
Reel/Frame 069236/0794 →
Continuity (10)
Continuation 18393916 · Dec 22, 2023
Continuation 18201276 · May 24, 2023
Continuation 17991030 · Nov 21, 2022
Continuation 17845052 · Jun 21, 2022
Continuation 17536886 · Nov 29, 2021
Continuation 17207881 · Mar 22, 2021
Continuation 16792973 · Feb 18, 2020
Continuation 15832244 · Dec 5, 2017
Provisional Application 62491040 · Apr 27, 2017
Related Publication 20250071188A1 · Feb 27, 2025
References Cited (183)
US 5068816A · Noetzel · 1991 [cited by applicant]
US 5274813A · Itoh · 1993 [cited by applicant]
US 5978511A · Horiuchi · 1999 [cited by applicant]
US 6064985A · Anderson · 2000 [cited by applicant]
US 6278981B1 · Dembo et al. · 2001 [cited by applicant]
US 6282520B1 · Schirripa · 2001 [cited by applicant]
US 6304858B1 · Mosler · 2001 [cited by applicant]
US 6317727B1 · May · 2001 [cited by applicant]
US 6333788B1 · Yamada · 2001 [cited by applicant]
US 6385249B1 · Kondo · 2002 [cited by applicant]
US 6424972B1 · Berger · 2002 [cited by applicant]
US 6820266B1 · Minakawa et al. · 2004 [cited by applicant]
US 7181422B1 · Philip · 2007 [cited by applicant]
US 7222317B1 · Mathur · 2007 [cited by applicant]
US 7236952B1 · D'Zmura · 2007 [cited by applicant]
US 7349878B1 · Makivic · 2008 [cited by applicant]
US 7356541B1 · Doughty · 2008 [cited by applicant]
US 7430539B2 · Glinberg · 2008 [cited by applicant]
US 7451237B2 · Takekawa · 2008 [cited by applicant]
US 7509275B2 · Glinberg · 2009 [cited by applicant]
US 7526487B1 · Bobbitt et al. · 2009 [cited by applicant]
US 7580876B1 · Phillips · 2009 [cited by applicant]
US 7587641B1 · Sloane · 2009 [cited by applicant]
US 7702563B2 · Balson · 2010 [cited by applicant]
US 7734538B2 · Bauerschmidt · 2010 [cited by applicant]
US 7809631B2 · Bauerschmidt et al. · 2010 [cited by applicant]
US 7822668B1 · Benda · 2010 [cited by applicant]
US 7870052B1 · Goldberg · 2011 [cited by applicant]
US 8108281B2 · Koblas · 2012 [cited by applicant]
US 8165942B1 · Rordorf · 2012 [cited by applicant]
US 8301537B1 · Rachev · 2012 [cited by applicant]
US 8515058B1 · Gentry · 2013 [cited by applicant]
US 8725621B2 · Marynowski · 2014 [cited by applicant]
US 8805735B1 · Goldberg · 2014 [cited by applicant]
US 8862560B1 · Wu · 2014 [cited by applicant]
US 9106936B2 · Wegener · 2015 [cited by applicant]
US 9165008B1 · Ramesh · 2015 [cited by examiner]
US 9396131B1 · Hendry · 2016 [cited by applicant]
US 9800885B2 · Newman · 2017 [cited by applicant]
US 10194097B2 · Abbas · 2019 [cited by applicant]
US 10203879B2 · Yamato · 2019 [cited by applicant]
US 10203897B1 · Cheah et al. · 2019 [cited by applicant]
US 10326862B2 · Bonig et al. · 2019 [cited by applicant]
US 10356174B2 · Stute · 2019 [cited by applicant]
US 10395394B2 · Flordal et al. · 2019 [cited by applicant]
US 10491384B2 · French et al. · 2019 [cited by applicant]
US 10616585B2 · Cremon et al. · 2020 [cited by applicant]
US 10656840B2 · Kotte et al. · 2020 [cited by applicant]
US 10740308B2 · Ding et al. · 2020 [cited by applicant]
US 10789588B2 · Burnham et al. · 2020 [cited by applicant]
US 10885010B2 · Hills et al. · 2021 [cited by applicant]
US 11170379B2 · Cash et al. · 2021 [cited by applicant]
US 11297459B2 · Raduchel et al. · 2022 [cited by applicant]
US 11314743B1 · Baptist · 2022 [cited by applicant]
US 11327947B1 · Brubaker et al. · 2022 [cited by applicant]
US 11907207B1 · Bawadhankar · 2024 [cited by applicant]
US 20020002528A1 · Terada · 2002 [cited by applicant]
US 20020038272A1 · Menchero · 2002 [cited by applicant]
US 20020138386A1 · Maggioncalda · 2002 [cited by applicant]
US 20020198803A1 · Rowe · 2002 [cited by examiner]
US 20030007676A1 · Cato · 2003 [cited by examiner]
US 20030028466A1 · Jenson · 2003 [cited by applicant]
US 20030036918A1 · Pintsov · 2003 [cited by applicant]
US 20030055777A1 · Ginsberg · 2003 [cited by applicant]
US 20030061577A1 · Saluja · 2003 [cited by applicant]
US 20030101026A1 · Rabinowitz · 2003 [cited by applicant]
US 20030130921A1 · Force et al. · 2003 [cited by applicant]
US 20030130944A1 · Force et al. · 2003 [cited by applicant]
US 20030130956A1 · Calderaro et al. · 2003 [cited by applicant]
US 20030236738A1 · Lange · 2003 [cited by applicant]
US 20040177023A1 · Krowas · 2004 [cited by applicant]
US 20040186804A1 · Chakraborty · 2004 [cited by applicant]
US 20040199448A1 · Chalermkraivuth · 2004 [cited by applicant]
US 20040205457A1 · Bent · 2004 [cited by applicant]
US 20040220870A1 · Lundberg · 2004 [cited by applicant]
US 20050050372A1 · Hagiwara · 2005 [cited by applicant]
US 20050055301A1 · Cohen · 2005 [cited by applicant]
US 20050096950A1 · Caplan · 2005 [cited by applicant]
US 20060059067A1 · Glinberg · 2006 [cited by applicant]
US 20060112049A1 · Mehrotra · 2006 [cited by applicant]
US 20060224494A1 · Pinkava · 2006 [cited by applicant]
US 20060259378A1 · Fornasari · 2006 [cited by applicant]
US 20070033123A1 · Navin · 2007 [cited by applicant]
US 20070083586A1 · Luo · 2007 [cited by applicant]
US 20070156555A1 · Orr · 2007 [cited by applicant]
US 20070186206A1 · Abrams · 2007 [cited by applicant]
US 20070198387A1 · Uenohara · 2007 [cited by applicant]
US 20070244785A1 · Williams · 2007 [cited by applicant]
US 20070271204A1 · Jiang · 2007 [cited by applicant]
US 20070288351A1 · Huntley · 2007 [cited by applicant]
US 20080120251A1 · Tyagi · 2008 [cited by applicant]
US 20080183615A1 · Rio · 2008 [cited by applicant]
US 20080196076A1 · Shatz · 2008 [cited by applicant]
US 20080235172A1 · Rosenstein · 2008 [cited by applicant]
US 20080249956A1 · Connors · 2008 [cited by applicant]
US 20080249958A1 · Anguish · 2008 [cited by applicant]
US 20080294571A1 · Maloney · 2008 [cited by applicant]
US 20080319920A1 · Levin · 2008 [cited by applicant]
US 20090138536A1 · Chao · 2009 [cited by applicant]
US 20090171826A1 · Hadi · 2009 [cited by applicant]
US 20090216824A1 · Weinberg · 2009 [cited by applicant]
US 20090248564A1 · Fallon · 2009 [cited by applicant]
US 20090265284A1 · Rowell · 2009 [cited by applicant]
US 20090281956A1 · An · 2009 [cited by applicant]
US 20090299910A1 · Khuong-huu · 2009 [cited by applicant]
US 20090307124A1 · Meyerhoff, II · 2009 [cited by applicant]
US 20100106633A1 · Iyer · 2010 [cited by applicant]
US 20100138362A1 · Whitehurst · 2010 [cited by applicant]
US 20100145875A1 · Schmid · 2010 [cited by applicant]
US 20100191628A1 · Arnott · 2010 [cited by applicant]
US 20100259204A1 · Imura · 2010 [cited by applicant]
US 20100280970A1 · Lai · 2010 [cited by applicant]
US 20100281086A1 · Ganai · 2010 [cited by applicant]
US 20100323350A1 · Gordon · 2010 [cited by applicant]
US 20100328530A1 · Hashimoto · 2010 [cited by applicant]
US 20110004568A1 · Phillips · 2011 [cited by applicant]
US 20110035342A1 · Koblas · 2011 [cited by applicant]
US 20110060603A1 · Capelli · 2011 [cited by applicant]
US 20110153521A1 · Green · 2011 [cited by applicant]
US 20110161244A1 · Iyer · 2011 [cited by applicant]
US 20110179112A1 · Ravichandran · 2011 [cited by applicant]
US 20110221489A1 · Tarng · 2011 [cited by applicant]
US 20110270670A1 · Leathern · 2011 [cited by applicant]
US 20120296793A1 · Wilson, Jr. · 2012 [cited by applicant]
US 20120317011A1 · Duquette · 2012 [cited by applicant]
US 20130018769A1 · Boudreault · 2013 [cited by applicant]
US 20130018818A1 · Yadav · 2013 [cited by applicant]
US 20130036074A1 · Kaestel · 2013 [cited by applicant]
US 20130041799A1 · Nyhoff · 2013 [cited by applicant]
US 20130041843A1 · Nyhoff · 2013 [cited by applicant]
US 20130117197A1 · Shah · 2013 [cited by applicant]
US 20130241933A1 · Thatcher · 2013 [cited by applicant]
US 20130282554A1 · Boberski · 2013 [cited by applicant]
US 20130339272A1 · Willism, III · 2013 [cited by applicant]
US 20140023167A1 · Meyer · 2014 [cited by applicant]
US 20140258072A1 · Mayor · 2014 [cited by applicant]
US 20150039530A1 · Jha et al. · 2015 [cited by applicant]
US 20150058146A1 · Gaddam · 2015 [cited by examiner]
US 20150063374A1 · Venkatachalam Jayaraman · 2015 [cited by applicant]
US 20150324914A1 · Zhan et al. · 2015 [cited by applicant]
US 20150365619A1 · Mayer · 2015 [cited by applicant]
US 20160077973A1 · Patsilaras et al. · 2016 [cited by applicant]
US 20160104155A1 · Mcgaugh et al. · 2016 [cited by applicant]
US 20160246266A1 · Kniazev · 2016 [cited by applicant]
US 20160285571A1 · Badiu · 2016 [cited by applicant]
US 20170046716A1 · Sheehan et al. · 2017 [cited by applicant]
US 20170061329A1 · Kobayashi · 2017 [cited by applicant]
US 20170132625A1 · Kennedy · 2017 [cited by applicant]
US 20170178128A1 · Fourez et al. · 2017 [cited by applicant]
US 20170323294A1 · Rohlfing et al. · 2017 [cited by applicant]
US 20170351731A1 · Brosch · 2017 [cited by examiner]
US 20180025422A1 · Dhala et al. · 2018 [cited by applicant]
US 20180247191A1 · Katz · 2018 [cited by applicant]
US 20180260456A1 · Chintakayala et al. · 2018 [cited by applicant]
US 20190258958A1 · Adjaoute · 2019 [cited by applicant]
US 20200117649A1 · Arnold et al. · 2020 [cited by applicant]
US 20200192590A1 · Kurichiyath et al. · 2020 [cited by applicant]
US 20200210411A1 · Yang · 2020 [cited by applicant]
US 20200249869A1 · Glimcher et al. · 2020 [cited by applicant]
US 20200301904A1 · Hirata · 2020 [cited by applicant]
US 20200410498A1 · Qu et al. · 2020 [cited by applicant]
US 20210057060A1 · Hussam · 2021 [cited by applicant]
US 20210096884A1 · Miller et al. · 2021 [cited by applicant]
US 20210097491A1 · Minyard et al. · 2021 [cited by applicant]
US 20210273649A1 · Li · 2021 [cited by applicant]
US 20220043690A1 · Kondiles et al. · 2022 [cited by applicant]
US 20220043755A1 · Kondiles · 2022 [cited by applicant]
US 20220138168A1 · Veselova et al. · 2022 [cited by applicant]
US 20220214944A1 · Shirley, Jr. et al. · 2022 [cited by applicant]
US 20220221997A1 · Navon et al. · 2022 [cited by applicant]
US 20220276919A1 · Kavali et al. · 2022 [cited by applicant]
US 20230359755A1 · Algie · 2023 [cited by applicant]
US 20230388101A1 · Resch · 2023 [cited by applicant]
WO 0150776A2 · 2001 [cited by applicant]
“TriOptima and LCH.Clearnet Compression of Cleared Interest Rate Swaps Exceeds $100 Trillion in Notational; $20.4 Trillion Compressed in 2012 Alone”, ICAP, 2 pages, http://www.icap.com/news/2012/trioptima-swap-clear-usd… [cited by applicant]
Extended European Search Report in EP Application No. 15174114.7, dated Nov. 4, 2015, 6 pages. [cited by applicant]
Extended European Search Report in EP Application No. 15191983.4, dated Dec. 17, 2015, 6 pages. [cited by applicant]
International Search Report in International Patent Application No. PCT/US2015/029941, dated Aug. 10, 2015, 2 pages. [cited by applicant]
ISDA, Interest Rate Swaps Compression: A Progress Report, ISDA Study, 9 pages, Feb. 2012. [cited by applicant]
Labuszewski et al., “Speculative Strategies with Treasury Options”, CME Group, 36 pages, Nov. 11, 2013. [cited by applicant]
Office Action in European Patent Application No. 15174114.7, dated Jun. 13, 2018, 7 pages. [cited by applicant]
Orcun Kaya, “Reforming OTC Derivatives Markets, Observable Changes and Open Issues”, Deutsche Bank, Current Issues, Global Financial Markets, 24 pages, Aug. 7, 2013. [cited by applicant]
Risk Management—Portfolio Compression for Outstanding Interest Rate Swap Trades, https://www.ccilindia.com/riskmanagement/pages/portfoliocompression.aspx, developed by NSE-IT and maintained by CCIL-IT, 1 page, May 6, 20… [cited by applicant]