US 11,720,522 B2
Efficient usage of one-sided RDMA for linear probing
Tinggang Wang, Columbus, OH (US); Shuo Yang, Columbus, OH (US); Hideaki Kimura, Palo Alto, CA (US); Garret F. Swart, Palo Alto, CA (US); and Spyros Blanas, Columbus, OH (US)
Assigned to ORACLE INTERNATIONAL CORPORATION, Redwood Shores, CA (US)
Filed by Oracle International Corporation, Redwood Shores, CA (US)
Filed on Feb. 16, 2021, as Appl. No. 17/176,856.
Claims priority of provisional application 63/038,333, filed on Jun. 12, 2020.
Prior Publication US 2021/0390075 A1, Dec. 16, 2021
Int. Cl. G06F 16/245 (2019.01); G06F 15/173 (2006.01)
CPC G06F 15/17331 (2013.01) [G06F 16/245 (2019.01)] 16 Claims
OG exemplary drawing
 
1. A system comprising:
one or more processors;
a memory storing instructions which, when executed by the one or more processors, causes performance of:
receiving a request to perform a probing operation on a remotely located linear hash table based on a key value;
prior to performing the probing operation, dynamically predicting a first number of slots for a single read of the linear hash table that minimizes total cost for an average probing operation;
determining a hash value based on the key value;
determining a slot of the linear hash table to which the hash value corresponds; and
after predicting the first number of slots, issuing a first remote direct memory access (RDMA) request to perform a read of the predicted first number of slots from the linear hash table starting at the slot to which the hash value corresponds.