发明名称 |
Functional memory based on a trie structure |
摘要 |
The invention relates to a method for implementing a functional memory and to a memory arrangement. The memory is implemented as a directory structure comprising a tree-shaped hierarchy having nodes at several different hierarchy levels. In the directory structure, pointers are first added to nodes whose table contains a given first number of elements and which are width-compressed nodes. To maximize the performance of the functional trie structure, addition of a pointer to an individual width-compressed node is permitted until the number of pointers in the node corresponds to a given predetermined threshold value that is smaller than said first number. The width-compressed node is converted to a cluster of nodes made up by a parent node (N50) and separate child nodes (N51 . . . N54) as soon as the number of pointers to be accommodated in the width-compressed node exceeds said threshold value. |
申请公布号 |
AU4407200(A) |
申请公布日期 |
2000.12.28 |
申请号 |
AU20000044072 |
申请日期 |
2000.04.28 |
申请人 |
NOKIA NETWORKS OY |
发明人 |
MATTI TIKKANEN;JUKKA-PEKKA IIVONEN |
分类号 |
G06F12/00;G06F17/30;H04Q3/545 |
主分类号 |
G06F12/00 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|