Optimization of server selection using euclidean analysis of...

Details Optimization of server selection using euclidean analysis of... Optimization of server selection using euclidean analysis of...

2006-11-28

2006-11-28

Vo, Tim (Department: 2168)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000, C707S793000, C708S200000, C708S490000, C715S252000, C715S700000, C715S764000, C715S848000

Reexamination Certificate

active

07143085

ABSTRACT:
Euclidean analysis is used to define queries in terms of a multi-axis query space where each of the keywords T1, T2, . . . Ti, . . . Tnis assigned an axis in that space. Sets of test queries Stfor each one from one of a plurality of server sources, are plotted in the query space. Clusters of the search terms are identified based on the proximity of the plotted query vectors to one another. Predominant servers are identified for each of the clusters. When a search query Ssis received, the location of its vector is determined and the servers accessed by the search query Ssare those that are predominant in the cluster which its vector may fall or is in closest proximity to.

REFERENCES:
patent: 5794178 (1998-08-01), Caid et al.
patent: 6629097 (2003-09-01), Keith
patent: 6836777 (2004-12-01), Holle
Jain et al., Data Clustering: A Review, 1999, ACM Computing Surveys, vol. 31, pp. 265-323.

Affiliated with

Also associated with

Rating

Optimization of server selection using euclidean analysis of... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimization of server selection using euclidean analysis of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimization of server selection using euclidean analysis of... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3630676