Method for storing a tree of potential keys in a sparse table

• US 5,857,196 A
• Filed: 07/19/1996
• Issued: 01/05/1999
• Est. Priority Date: 07/19/1996
• Status: Expired due to Fees

• Current Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Original Assignee: Bay Networks, Inc. (Nortel Networks Corporation)
• Inventors: Ladwig, Geoffrey B., Harriman, Edward S. Jr., Angle, Richard L.
• Primary Examiner(s): AMSBURY, WAYNE P
• Application Number:
  US08/690,225
• Time in Patent Office: 900 Days
• Field of Search: 395/603, 395/607, 395/613, 395/615, 707/3, 707/7, 707/102, 707/104
• US Class Current: 1/1
• CPC Class Codes: G06F 16/322 Trees
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99937 Sorting
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

A computer implemented method for searching for a key in a radix search tree in a memory of a computer system. A table of keys is organized in a radix search tree stored in a memory of a computer system. The keys are divided into a string of symbols. Each node in the tree corresponds to a symbol. A path from a root node to a leaf node at level n in the tree represents a string of n symbols comprising a key. Each node is capable of having m possible entries corresponding to m possible symbol values. Each entry comprises a pointer to a son node and an existence map indicating which entries exist in the son node. In the preferred embodiment, the existence map is a bit mask that indicates, based on bit positions enabled and disabled in the bit mask, which entries exist in the son node pointed to by the pointer. By providing an existence map along with the pointer to a son node, m memory locations for m entries are allocated for the son node only if all of the m possible entries are used. Memory locations for entries that would otherwise be empty are not allocated, thereby minimizing memory resources required by a radix search tree.

Claims

1. A computer implemented method for searching for a key in a table, where the sparse table of potential keys is organized as a tree in a memory of a computer system, comprising:

a) receiving a key;

b) dividing the key into a string of n symbols;

c) searching the tree for the string of n symbols, comprising;

i) comparing a first symbol in the string of n symbols with an existence map associated with a root node in the tree;

ii) traversing the tree to a son node in the tree pointed to by an entry in the root node corresponding to the first symbol if the existence map associated with the root node indicates the entry exists;

iii) comparing a next symbol in the string of n symbols with an existence map associated with the son node in the tree;

iv) traversing the tree to a subsequent son node in the tree pointed to by an entry in the son node corresponding to the next symbol if the existence map associated with the son node indicates the entry exists;

v) repeating steps iii and iv until the comparison fails or the next symbol is the last symbol in the string of symbols.

2. The method of claim 1, wherein dividing the key into a string of n symbols includes dividing the key into a string of n hexadecimal digits, where each hexadecimal digit represents a symbol.

3. The method of claim 1 wherein comparing a first symbol in the string of n symbols with an existence map associated with a root node in the tree includes comparing a first symbol in the string of n symbols with a bit mask associated with the root node.

4. The method of claim 3 wherein traversing the tree to a son node in the tree pointed to by an entry in the root node corresponding to the first symbol if the existence map associated with the root node indicates the entry exists includes traversing the tree to a son node in the tree pointed to by an entry in the root node corresponding to the first symbol if a bit position corresponding to the first symbol is enabled in the bit mask indicating the entry exists.

5. The method of claim 1 wherein comparing a next symbol in the string of n symbols with an existence map associated with the son node in the tree includes comparing the next symbol in the string of n symbols with a bit mask associated with the son node.

6. The method of claim 5 wherein traversing the tree to a subsequent son node in the tree pointed to by an entry in the son node corresponding to the next symbol if the existence map associated with the son node indicates the entry exists includes traversing the tree to a subsequent son node in the tree pointed to by an entry in the son node corresponding to the next symbol if a bit position corresponding to the next symbol is enabled in the bit mask associated with the son node indicating the entry exists.

7. The method of claim 6 wherein repeating steps iii and iv until the comparison fails or the next symbol is the last symbol in the string of symbols comprises:

traversing the tree to a subsequent son node in the tree pointed to by an entry in the son node corresponding to the next symbol until a bit position corresponding to the next symbol is disabled in the bit mask associated with the son node indicating the entry does not exist.