Using activation paths to cluster proximity query results

Details Using activation paths to cluster proximity query results Using activation paths to cluster proximity query results

2007-03-27

2009-12-22

Wong, Don (Department: 2163)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

07636713

ABSTRACT:
A search engine finds and ranks information in clusters so a user can select information listed in search results that are closer to his information needs. To do so, the search engine receives a proximity query and executes it against an entity-relationship graph. The search engine finds those entities in the graph that have similar relationships between nodes. For example, two entities in a graph may be connected to entirely different nodes, but they may connect to those different nodes using similarly labeled paths. The search engine identifies the relationship between the nodes, clusters entities that are connected by similar relationships, and presents the clustered information to the user as part of the search results. In this way, the search engine provides a user with a results from which the user can select the group of results that most closely match his information need.

REFERENCES:
patent: 6434556 (2002-08-01), Levin et al.
patent: 6442545 (2002-08-01), Feldman et al.
patent: 6636853 (2003-10-01), Stephens, Jr.
patent: 7272612 (2007-09-01), Birdwell et al.
patent: 7464074 (2008-12-01), Sebbane
patent: 2005/0108203 (2005-05-01), Tang et al.
patent: 2006/0031219 (2006-02-01), Chernyak et al.
patent: 2006/0117002 (2006-06-01), Swen
Goldman et al. “proximity search in database”, infolab.stanford.edu, 1998, pp. 1-24.
Baeza-Yates et al., “Generalization PageRank: Damping Functions for Link-Based Ranking Algorithms”SIGIR, Seattle, Washington, Aug. 6-10, 2006, 8 pages.
Bhalotia, et al., “Keyword Searching and Browsing in Databases using BANKS” Computer Science and Engg. Dept., I.I.T. Bombay, 10 pages.
Balmin et al., “ObjectRank: Authority-Based Keyword Search in Databases” Proceeding of the 30thVLDB Conference, Toronto, Canada 2004, 12 pages.
Goldman et al., “Proximity Search in Databases” Proceedings of the 24thVLDB Conference, New York, USA, 1998, pp. 26-37.
Haveliwala, Taher H., “Topic-Sensitive PageRank”WWW2002, Honolulu, Hawaii, USA, May 7-11, 2002, 10 pgs.

Affiliated with

Also associated with

Rating

Using activation paths to cluster proximity query results 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 activation paths to cluster proximity query results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using activation paths to cluster proximity query results will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4053284