Computer system and method which sort array elements to optimize array modifications
US5924092A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Feb 7, 1997 |
| Grant date | Jul 13, 1999 |
| Priority date | — |
| Expiry date | Feb 7, 2017 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99942
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A sorting algorithm is applied to an array data structure to arrange array elements according to the predicted frequency by which those array elements are likely to be modified. Higher modification frequency array elements are arranged proximate the end of the array to minimize the number of array elements that will typically need to be updated in response to modification of these array elements, reserving the modifications that require more array elements to be updated to those array elements that have a lower likelihood of modification. A sorting algorithm suitable for use in memory compression arranges blocks for a given page in reverse order since data located proximate the beginning of a page has a higher probability of being modified than the data proximate the end of the page.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.