The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jun. 10, 2025
Filed:
Mar. 29, 2024
Oracle International Corporation, Redwood Shores, CA (US);
Hugo Kapp, Zurich, CH;
Laurent Phillipe Daynes, Saint-Ismier, FR;
Vlad Ioan Haprian, Zurich, CH;
Ioannis Alagiannis, Zurich, CH;
Hassan Chafi, San Mateo, CA (US);
Sungpack Hong, Palo Alto, CA (US);
Andrew Witkowski, Foster City, CA (US);
Angela Amor, Menlo Park, CA (US);
Huagang Li, San Jose, CA (US);
Oracle International Corporation, Redwood Shores, CA (US);
Abstract
A breadth first search (BFS) algorithm is provided that uses out-of-core external storage in a memory constrained system. Memory resources are used as long as they are available and external storage is used when necessary due to memory pressure. The BFS algorithm uses a disk-spilling hash-table (DSH) as the visited set and disk-spilling queues (DSQs) as the BFS frontier queue. To get the most out of the DSH, subsequent inserts and lookups must happen in the same DSH partition. To ensure that consecutive lookups happen in the same DSH partition, the BFS frontier queue is partitioned in a manner similar to the DSH partitions.