US6732116B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for dynamically managing data structures to optimize computer network performance
Assignee: International Business Machines Corp
•
Filing: 2001-06-21
•
Granted: 2004-05-04
•
Expires: 2021-06-21
Abstract
Abstract A method and system for providing and dynamically managing the size of a storage space containing data structures depending on a current network load. The present invention expands the size of a storage space when the amount of data therein is large, thereby reducing the time spent searching for values within the data structure. When the amount of data within the storage space is small, the present invention contracts the size of the storage space to reduce the memory needed to maintain the storage space. In this manner, the present invention dynamically adjusts the size of the storage space in response to changing network loads to ensure that network performance remains optimized.
Inventors
- 👤 Dwip N. Banerjee
- 👤 David Marquardt
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 06:20
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/50; G06F9/5005; G06F9/5011; G06F9/5016; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99943
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
94 words
A method of managing storage space used for storing data items on a storage device of a computer network, comprising: storing the data items within a storage space having an initial size; defining a threshold number of data items to be stored in the storage space; varying the initial size of the storage space when the number of data items is greater than or less than the threshold number of data items; and maintaining variance of the size of the storage space during varying transfer loads of the data items within the computer network.
Claim 2
Independent Claim
94 words
A method of managing storage space used for storing data items on a storage device of a computer network, comprising: storing the data items within a storage space having an initial size; defining a threshold number of data items to be stored in the storage space; varying the initial size of the storage space when the number of data items is greater than or less than the threshold number of data items; and maintaining variance of the size of the storage space during varying transfer loads of the data items within the computer network.
Claim 3
Dependent Claim
33 words
The method as set forth in claim 1 , wherein the size of the storage space is expanded if the number of data items is greater than the threshold number of data items.
Claim 4
Dependent Claim
33 words
The method as set forth in claim 1 , wherein the size of the storage space is contracted if the number of data items is less than the threshold number of data items.
Claim 5
Dependent Claim
20 words
The method as set forth in claim 1 , wherein the storage space is divided into a plurality of cells.
Claim 6
Dependent Claim
32 words
The method as set forth in claim 4 , wherein the threshold number of data items is the maximum number of data items that each of the plurality of cells may contain.
Claim 7
Dependent Claim
20 words
The method as set forth in claim 4 , wherein the storage space is expanded one cell at a time.
Claim 8
Dependent Claim
52 words
The method as set forth in claim 4 , wherein if one or more of the plurality of cells contains enough storage space to store data items in a particular cell, the data items are stored in the one or more of the plurality of cells and the particular cell is removed.
Claim 9
Dependent Claim
41 words
The method as set forth in claim 7 , further comprising: determining that a linked list of data items in a particular cell is greater than the threshold number of data items; and adding a new cell to the hash table.
Claim 10
Dependent Claim
37 words
The method as set forth in claim 7 , further comprising: determining that a linked list of data items in a particular cell is less than the threshold number of data items; and deleting the particular cell.
Claim 11
Dependent Claim
37 words
The method as set forth in claim 1 , wherein the storage space is a hash table having plurality of cells and at least one of the plurality of cells contains a linked list of data items.
Claim 12
Dependent Claim
18 words
A computer-readable medium having computer-executable instructions thereon for performing the method as set forth in claim 1 .
Claim 13
Independent Claim
86 words
A method for managing a data structure having data items stored therein, comprising: separating the data structure into a number of cells; defining a threshold number of data items; determining whether the number of cells should be changed based on a comparison between the threshold number and a number of data items stored within each cell; and maintaining the comparison between the threshold number and the number of data items stored within each cell during varying transfer loads of the data items within a computer network.
Claim 14
Independent Claim
86 words
A method for managing a data structure having data items stored therein, comprising: separating the data structure into a number of cells; defining a threshold number of data items; determining whether the number of cells should be changed based on a comparison between the threshold number and a number of data items stored within each cell; and maintaining the comparison between the threshold number and the number of data items stored within each cell during varying transfer loads of the data items within a computer network.
Claim 15
Dependent Claim
36 words
The method as set forth in claim 12 , further comprising: determining that the number of data items in a cell is greater than the threshold number of data items; and increasing the number of cells.
Claim 16
Dependent Claim
36 words
The method as set forth in claim 12 , further comprising: determining that the number of data items in a cell is less than the threshold number of data items; and decreasing the number of cells.
Claim 17
Dependent Claim
24 words
The method as set forth in claim 12 , wherein the number of data items within a cell are contained in a linked list.
Claim 18
Dependent Claim
34 words
The method as set forth in claim 15 , further comprising adding a new cell if the number of data items in the linked list is greater than the threshold number of data items.
Claim 19
Dependent Claim
38 words
The method as set forth in claim 15 , further comprising deleting an existing cell if the number of data items in the linked list of the existing cell is less than the threshold number of data items.
Claim 20
Dependent Claim
99 words
The method as set forth in claim 15 , further comprising: rearranging the data items between linked lists in the number of cells based on the comparison; determining that the number of data items in a linked list of a first cell is greater than the threshold number of data items; and adding one of the data items in the linked list of the first cell to another linked list in a second cell such that the number of data items in the linked list of the second cell is not greater than the threshold number of data items.
Claim 21
Dependent Claim
77 words
The method as set forth in claim 15 , further comprising: rearranging the data items between linked lists in the number of cells based on the comparison; determining that the number of data items in a linked list of a first cell is less than the threshold number of data items; adding the number data items in the linked list of the first cell to another linked list in a second cell; and deleting the first cell.
Claim 22
Dependent Claim
138 words
In a computer system having a processor for processing data items, a memory containing a data structure having a size for storing data items, and a display for displaying processed data items to a user, a data structure management system for managing the data items stored within the data structure, comprising: a dynamic data structure management module that defines a threshold number of data items to be stored in the data structure and expands the size of the data structure when the number of data items is greater than the threshold number and contracts the size of the data structure when the number of data items is less than the threshold number; and a maintain module that maintains variance of the size of the data structure during varying transfer loads of the data items within the computer system.
Claim 23
Dependent Claim
138 words
In a computer system having a processor for processing data items, a memory containing a data structure having a size for storing data items, and a display for displaying processed data items to a user, a data structure management system for managing the data items stored within the data structure, comprising: a dynamic data structure management module that defines a threshold number of data items to be stored in the data structure and expands the size of the data structure when the number of data items is greater than the threshold number and contracts the size of the data structure when the number of data items is less than the threshold number; and a maintain module that maintains variance of the size of the data structure during varying transfer loads of the data items within the computer system.
References Cited (Backward Citations)
US4636946A
Cited
US5287499A
Cited
US5542066A
Cited
US5592432A
Cited
US5751993A
Cited
US6067608A
Cited
US6067547A
Cited
US6286080B1
Cited
US6453360B1
Cited
US6530008B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-05-04 | 2007-11-03 | 2008-05-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-05-04 | 2011-11-03 | 2012-05-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-05-04 | 2015-11-03 | 2016-05-04 | $7700.00 | Window Closed / Lapsed |