Importance ranking for a hierarchical collection of objects

Data processing: database and file management or data structures – Database and file access – Preparing data for information retrieval

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07809736

ABSTRACT:
A system and method of obtaining an importance ranking for a hierarchical collection of objects. The hierarchical collection of objects is represented as a tree containing a plurality of nodes, and each node to be ranked is represented as a respective leaf node of the tree. To obtain the ranking of the respective leaf nodes, the system and method locally ranks nodes contained in one or more sub-trees of the tree, in which each sub-tree has a depth equal to one. Next, the local rankings are effectively propagated up the tree, and the local rankings are aggregated at each level of the hierarchy, until a final importance ranking for the leaf nodes is obtained.

REFERENCES:
patent: 5379422 (1995-01-01), Antoshenkov
patent: 5864867 (1999-01-01), Krusche et al.
patent: 6233575 (2001-05-01), Agrawal et al.
patent: 6757587 (2004-06-01), English et al.
patent: 7251654 (2007-07-01), Eiron et al.
patent: 2002/0174147 (2002-11-01), Wang et al.
patent: 2004/0019598 (2004-01-01), Huang et al.
patent: 2004/0088118 (2004-05-01), Jensen et al.
patent: 2006/0056363 (2006-03-01), Ratiu et al.

LandOfFree

Say what you really think

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

Rating

Importance ranking for a hierarchical collection of objects does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Importance ranking for a hierarchical collection of objects, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Importance ranking for a hierarchical collection of objects will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4206479

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