Computer system and method which sort array elements to optimize array modifications
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Jul 13, 1999
Grant Date -
N/A
app pub date -
Feb 7, 1997
filing date -
Feb 7, 1997
priority date (Note) -
Expired
status (Latency Note)
Importance
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.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully