Data processing: database and file management or data structures – Database and file access – Query optimization
Reexamination Certificate
2011-04-05
2011-04-05
Fleurantin, Jean B. (Department: 2162)
Data processing: database and file management or data structures
Database and file access
Query optimization
C707S728000
Reexamination Certificate
active
07921100
ABSTRACT:
The similarity between a query set comprising query set tokens and a database set comprising database set tokens is determined by a similarity score. The database sets belong to a data collection set, which contains all database sets from which information may be retrieved. If the similarity score is greater than or equal to a user-defined threshold, the database set has information relevant to the query set. The similarity score is calculated with an inverse document frequency method (IDF) similarity measure independent of term frequency. The document frequency is based at least in part on the number of database sets in the data collection set and the number of database sets which contain at least one query set token. The length of the query set and the length of the database set are normalized.
REFERENCES:
patent: 7139756 (2006-11-01), Cooper et al.
patent: 7152065 (2006-12-01), Behrens et al.
patent: 7219089 (2007-05-01), Kobayashi et al.
patent: 7283999 (2007-10-01), Ramesh et al.
patent: 2005/0021517 (2005-01-01), Marchisio
patent: 2006/0190425 (2006-08-01), Chang et al.
patent: 2007/0067361 (2007-03-01), Bailey et al.
patent: 2007/0185871 (2007-08-01), Canright et al.
patent: 2007/0239705 (2007-10-01), Hunt et al.
patent: 2008/0294651 (2008-11-01), Masuyama et al.
R. Fagin, et al., “Optimal Aggregation Algorithms for Middleware”. J. Computer and System Sciences 66 (2003), pp. 614-656.
S. Robertson. “Understanding Inverse Document Frequency: On Theoretical Arguments for IDF”. J. Documentation 60 (5), pp. 503-520, (2004).
H. Bast, et al., “IO-Top-k: Index-access Optimized Top-k Query Processing”. VLDB '06. Seoul, Korea. pp. 475-486 (2006).
Chandel Amit
Hadjieleftheriou Marios
Koudas Nick
Srivastava Divesh
AT&T Intellectual Property I L.P.
Fleurantin Jean B.
Myint Dennis
LandOfFree
Set similarity selection queries at interactive speeds does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Set similarity selection queries at interactive speeds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Set similarity selection queries at interactive speeds will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2705038