Data processing: database and file management or data structures – Database and file access – Post processing of search results
Reexamination Certificate
2011-06-14
2011-06-14
Trujillo, James (Department: 2159)
Data processing: database and file management or data structures
Database and file access
Post processing of search results
C707S730000, C707S750000, C707S803000, C707S804000
Reexamination Certificate
active
07962480
ABSTRACT:
The relevance of documents is automatically determined based upon a weighted tree. Terms considered to be relevant are assigned to the leaf nodes of a tree data structure. A location can also be specified in a leaf node, indicating where in a document the term must appear to be considered relevant. Internal nodes of the tree are assigned operators (e.g., add, maximum or minimum). The connections between nodes are assigned weights. A relevance value for a given document is calculated as a function of occurrence in the document of terms assigned to leaves, operators assigned to internal nodes, and weights assigned to the associated node connections. Weighted trees can be used to process search queries. Documents with high relevance scores calculated against the tree can be returned to a user as the results to a query.
REFERENCES:
patent: 5873081 (1999-02-01), Harel
patent: 7596581 (2009-09-01), Frank et al.
patent: 2009/0319565 (2009-12-01), Greenwald et al.
Feng Shicong
Xiong Yuhong
Zhang Li
Zhao Yong
Hewlett--Packard Development Company, L.P.
Moser Bruce M
Trujillo James
LandOfFree
Using a weighted tree to determine document relevance does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Using a weighted tree to determine document relevance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using a weighted tree to determine document relevance will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2623363