Sorting large data sets
US8478755B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Apr 20, 2006 |
| Grant date | Jul 2, 2013 |
| Priority date | — |
| Expiry date | Aug 15, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F12/0802
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A computer-implemented sorting method for efficiently sorting large data sets in computing environments that include virtual memory and processor caching, the method including determining available physical memory, identifying portions of the data set that each fit in the available physical memory, determining available cache, identifying sub-portions within the portions that each fit in the available cache, sorting each sub-portion, repeating the identifying portions, identifying sub-portions, and sorting for each portion of the data set, and merging the sorted sub-portions and portions such that the data set is sorted. The sorting method avoids the use of virtual memory and seeks to identify sub-portions that fit in available cache.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.