Prefix search tree with partial key branching

G - Physics – 06 – F

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

354/112

G06F 17/30 (2006.01)

Patent

CA 2022970

ABSTRACT OF THE DISCLOSURE A prefix index tree structure for locating data records stored through keys related to information stored in data records. Each node includes a prefix field for a prefix string of length p of the longest string of key characters shared by all subtrees of the node and a data record field for a reference to a data record whose key is completed by the prefix string. A node may include one or more branch fields when the prefix string is a prefix of keys stored in at least one subtree of the node, with a branch field for each distinct p+1st key character in the keys, wherein each p+1st key character is a branch character. Each branch field includes a branch character and a branch pointer field for a reference to a node containing at least one key whose p+1st character is the branch character. Each node further includes a field for storing the number of key characters in the prefix string and a field for storing the number of branch fields in the node. Also disclosed are methods for constructing and searching a prefix index tree of the present invention, and for inserting nodes into the tree and deleting nodes from the tree.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Prefix search tree with partial key branching does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Prefix search tree with partial key branching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prefix search tree with partial key branching will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1827072

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.