Computer implemented compact 0-complete tree dynamic storage...

Details Computer implemented compact 0-complete tree dynamic storage... Computer implemented compact 0-complete tree dynamic storage...

2006-08-22

2006-08-22

Kindred, Alford (Department: 2161)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

07096235

ABSTRACT:
A method and apparatus for storage, insertion, deletion, and searching of a database index using a compact representation of a 0-complete binary tree. The compact representation, termed a C0-trie, is represented in a computer memory as a set of layered vectors with the layering of the vectors corresponding to the depths of the C0-trie. Insertion and deletion processes maintain the representation of the C0-trie remains in a well-formed and taut state at the end of each operation, thus providing subsequent efficient manipulations of the C0-trie in computer memory.

REFERENCES:
patent: 5640551 (1997-06-01), Chu et al.
patent: 5787430 (1998-07-01), Doeringer et al.
patent: 5930805 (1999-07-01), Marquis
patent: 2002/0052869 (2002-05-01), O'Keeffe et al.
PCT/US04/08923 Search Report, Dated Sep. 20, 2004, 3 pages.
PCT/US04/08923 Written Opinion, Dated Oct. 12, 2004, 5 pages.

Affiliated with

Also associated with

Rating

Computer implemented compact 0-complete tree dynamic storage... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Computer implemented compact 0-complete tree dynamic storage..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer implemented compact 0-complete tree dynamic storage... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3686583