Packed radix search tree implementation

Details Packed radix search tree implementation Packed radix search tree implementation

2005-05-31

2005-05-31

Vincent, David (Department: 2661)

Data processing: database and file management or data structures

Database design

Data structure types

C370S395320

Reexamination Certificate

active

06901396

ABSTRACT:
A packed radix data system is described, the packed radix data system including packed nodes which include a base pointer and an existence field, the existence field having a number of bits which indicate the existence or non-existence of a possible child node. By counting the number of bits to the left of an indexed bit in the existence field, an offset value is determined. The offset value is combined with the base pointer value to determine the child node address.

REFERENCES:
patent: 5666528 (1997-09-01), Thai
patent: 5907848 (1999-05-01), Zaiken et al.
patent: 5978792 (1999-11-01), Bhargava et al.
patent: 6167393 (2000-12-01), Davis et al.
patent: 6185557 (2001-02-01), Liu
patent: 6490548 (2002-12-01), Engel
patent: 2003/0200452 (2003-10-01), Tagawa et al.

Affiliated with

Also associated with

Rating

Packed radix search tree implementation does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3460791