Concurrent traversal of multiple binary trees

Details Concurrent traversal of multiple binary trees Concurrent traversal of multiple binary trees

2009-07-24

2011-12-13

Nguyen, Cam-Linh (Department: 2161)

Data processing: database and file management or data structures

Database design

Data structure types

C707S764000, C707S706000

Reexamination Certificate

active

08078642

ABSTRACT:
In one embodiment, a tree traversal sequentially processes every level of two or more binary trees until reaching a leaf node for each the binary trees. Processing each level of the binary trees comprises: determining whether each traversed node of the remaining binary trees at the level is a non-leaf node or a leaf node; for the traversed leaf nodes at the level, remove the binary trees to which the leaf nodes belong from the remaining binary trees; and iteratively evaluating the traversed non-leaf nodes at the level of every n remaining binary trees until the non-leaf nodes at the level of all of the remaining binary trees are evaluated, where n≧2 and evaluating the non-leaf nodes of each n binary trees comprises concurrently evaluating the n non-leaf nodes of the n binary trees to determine to which one of the two child nodes of each of the n non-leaf nodes to traverse.

REFERENCES:
patent: 6785687 (2004-08-01), Baskins et al.
patent: 6816856 (2004-11-01), Baskins et al.
patent: 7194456 (2007-03-01), Longshaw
patent: 7478109 (2009-01-01), Panigrahy et al.
SIMD, In computing, SIMD (Single Instruction, Multiple Data; colloquially, “vector instructions,” is a technique employed to achieve data level parallelism, printed Jul. 22, 2009, 5 pages.
Salford Systems, “Frequently Asked Questions and Answers about TreeNet,” printed Jul. 22, 2009, 4 pages.
TreeNet, “About Salford Systems,” Jerome Friedman's Revolutionary New Contribution to Date Mining, an Alternative to Neural Nets and Support Vector Machines, printed Jul. 22, 2009, 2 pages.

Affiliated with

Also associated with

Rating

Concurrent traversal of multiple binary trees does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Concurrent traversal of multiple binary trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concurrent traversal of multiple binary trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4260964