Patent ID: 6567815
Filing Date: 2003-05-20
Classification: G06F,Y10S

Abstract:
A method of arranging a tree structure in a memory, comprising the steps of:defining a tree data structure, wherein a parent node in said tree has a predetermined number of child nodes; defining an indexed array of data elements for storage thereof in a memory, wherein each said element represents a node of said tree; associating said parent node of said tree with a first index of said array, and associating each said child node of said parent node with second indices of said array, wherein predefined individual functional relationships exist between said first index and each of said second indices; mapping the nodes indexed by said first index and by said second indices to a predefined area of a memory; and determining a third index of any grandchild node of said parent node in said array using no more than one arithmetic expression comprising a constant linear coefficient of said first index.