US 12,248,487 B2
Techniques for in memory key range searches
Naveen Pishe, San Ramon, CA (US); and Abhilash Srimat Tirumala Pallerlamudi, Mountain View, CA (US)
Assigned to VISA INTERNATIONAL SERVICE ASSOCIATION, San Francisco, CA (US)
Filed by Visa International Service Association, San Francisco, CA (US)
Filed on Jun. 2, 2022, as Appl. No. 17/831,240.
Application 17/831,240 is a continuation of application No. 16/315,491, granted, now 11,392,600, previously published as PCT/US2016/053189, filed on Sep. 22, 2016.
Prior Publication US 2022/0292093 A1, Sep. 15, 2022
Int. Cl. G06F 16/00 (2019.01); G06F 16/22 (2019.01); G06F 16/2458 (2019.01); G06F 16/248 (2019.01); G06F 16/901 (2019.01)
CPC G06F 16/2474 (2019.01) [G06F 16/2246 (2019.01); G06F 16/2255 (2019.01); G06F 16/248 (2019.01); G06F 16/9027 (2019.01)] 19 Claims
OG exemplary drawing
 
1. A method comprising:
generating a first indexed list comprising a plurality of entries that comprise a plurality of index values and a plurality of data instances respectively corresponding to the plurality of entries;
generating a first tree map with nodes mapping minimum range values to the plurality of index values;
generating a second tree map that is different from the first tree map, the second tree map mapping at least one minimum range value to at least one index value of the first indexed list;
sorting nodes of the first tree map according to corresponding minimum range values associated with the nodes of the first tree map; and
generating a hash map comprising a plurality of hash values formed from hashed keys, and a corresponding plurality of key values, the key values comprising locations of the first tree map and the second tree map.